LP-branching algorithms based on biased graphs
- Submitting institution
-
Royal Holloway and Bedford New College
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 28975082
- Type
- E - Conference contribution
- DOI
-
10.1137/1.9781611974782.102
- Title of conference / published proceedings
- Proceedings of the 2017 Annual ACM-SIAM Symposium on Discrete Algorithms
- First page
- 1559
- Volume
- -
- Issue
- -
- ISSN
- -
- Open access status
- -
- Month of publication
- -
- Year of publication
- 2017
- 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
- 1
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper improves on results for FPT optimization algorithms by using a connection to matroid theory to replace the heavy machinery of previous work with more direct methods, enabling a larger class of problems to be covered while also allowing for a more transparent characterization of applicability. This paper appeared at one of the most selective conferences in theoretical computer science. Follow-up work includes Iwata et al. (FOCS 2018) for linear-time FPT algorithms. The methods of the paper were also used to produce improved approximation results (Lee and Wahlström, 2020).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -