A Colored Path Problem and Its Applications
- Submitting institution
-
Royal Holloway and Bedford New College
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 39451651
- Type
- D - Journal article
- DOI
-
10.1145/3396573
- Title of journal
- ACM Transactions on Algorithms (TALG)
- Article number
- 47
- First page
- 1
- Volume
- 16
- Issue
- 4
- ISSN
- 1549-6325
- Open access status
- Out of scope for open access requirements
- 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
-
1
- Research group(s)
-
-
- Citation count
- 0
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Given a set of obstacles in the plane, can we remove k obstacles so that there is an obstacle-free path between the two designated points? This is a fundamental problem extensively studied by researchers in various areas, including computational geometry, graph theory, wireless computing, and motion planning. Our positive result directly implies previously known results for various obstacle shapes including unit disks and fat regions that are particularly important for the wireless computing applications. This article is the journal version of an ICALP-2018 paper, which led to another publication in a top computational geometry conference SoCG 2020.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -