Improved Approximation Ratios for Multiway Cut
Prior state unknown→proved
Record bounds on the ratio; the exact approximability of Multiway Cut remains open.
SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
theoretical-computer-science / Approximation algorithms
Improved Approximation Ratios for Multiway Cut
New upper and lower bounds on the approximation ratio achievable for Multiway Cut via large mixtures of new and old rounding schemes for the CKR relaxation, advancing the ratio ladder that has run since Călinescu-Karloff-Rabani (1998).
15Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts
Temporal state
Current frontier
No reconciled state yet.
Append-only history
Frontier timeline
Research memory
Claims and attempts
Scoped claims
New upper and lower bounds on the approximation ratio achievable for Multiway Cut via large mixtures of new and old rounding schemes for the CKR relaxation, advancing the ratio ladder that has run since Călinescu-Karloff-Rabani (1998).
Record bounds on the ratio; the exact approximability of Multiway Cut remains open.
Recorded attempts
Evidence graph
Connected research record
No public relationships recorded yet.