Half-integrality, LP-branching, and FPT Algorithms
- Submitting institution
-
Royal Holloway and Bedford New College
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 28975081
- Type
- D - Journal article
- DOI
-
10.1137/140962838
- Title of journal
- SIAM Journal on Computing
- Article number
- -
- First page
- 1377
- Volume
- 45
- Issue
- 4
- ISSN
- 0097-5397
- Open access status
- Compliant
- Month of publication
- August
- Year of publication
- 2016
- 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
-
2
- Research group(s)
-
-
- Citation count
- 19
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper is a breakthrough result on using LP-relaxations to back up FPT optimization algorithms for several important problems. Although previous results of this form existed, they were limited in scope. The results of this paper include several algorithms that are still the fastest known for their problems, up to a polynomial factor. Research led to the grant EP/P007228 "Polytope methods in parameterized complexity" and further follow-up work, including linear-time algorithms for many of the problems. Journal version of paper from SODA 2014.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -