On quasipolynomial multicut-mimicking networks and kernelization of multiway cut problems
- Submitting institution
-
Royal Holloway and Bedford New College
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 38348723
- Type
- E - Conference contribution
- DOI
-
10.4230/LIPIcs.ICALP.2020.101
- Title of conference / published proceedings
- ICALP 2020
- First page
- 1
- Volume
- -
- Issue
- -
- ISSN
- -
- Open access status
- -
- Month of publication
- June
- Year of publication
- 2020
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
0
- Research group(s)
-
-
- Citation count
- -
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- The existence of a polynomial kernel for Multiway Cut has been a major open problem in parameterized complexity since at least 2010. Some restricted cases were settled in 2012, in one of the breakthrough papers of the field (Kratsch and W., FOCS 2012/JACM 2020), but no progress has been made for the general case. The results of this paper marks a large step forward in this regard, showing an "almost constructive" bound of "almost" polynomial size, with several consequence for related problems.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -