On r-Simple k-Path and Related Problems Parameterized by k/r
- Submitting institution
-
Royal Holloway and Bedford New College
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 33977863
- Type
- E - Conference contribution
- DOI
-
10.1137/1.9781611975482.105
- Title of conference / published proceedings
- Proceedings of the 2019 Annual ACM-SIAM Symposium on Discrete Algorithms
- First page
- 1750
- Volume
- -
- Issue
- -
- ISSN
- -
- Open access status
- -
- Month of publication
- January
- Year of publication
- 2019
- 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
- -
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- We give algorithms for problems such as "r-simple k-path" where the solution is a long walk of length k, allowing vertices to be reused up to r times, for large values of k and r. We give algorithms for such problems that are efficient when parameterized by k/r as a ratio. This requires an interesting selection of tools that is quite different from how the "normal" versions of these problems can be tackled; in particular, the usual algebraic tools no longer apply. The paper was accepted at one of the top conferences in theoretical computer science.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -