Geometric Multicut: Shortest Fences for Separating Groups of Objects in the Plane
- Submitting institution
-
City, University of London
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 1249
- Type
- D - Journal article
- DOI
-
10.1007/s00454-020-00232-w
- Title of journal
- Discrete & Computational Geometry
- Article number
- -
- First page
- 575
- Volume
- 64
- Issue
- 3
- ISSN
- 0179-5376
- Open access status
- Compliant
- Month of publication
- August
- 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
-
3
- Research group(s)
-
-
- Citation count
- 0
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper presents the first non-trivial algorithmic and complexity results for a fundamental problem, a geometric version of the well-studied multi-cut problem in graphs, and a generalisation of a well-known problem arising in image segmentation. Research initiated at the Fixed-Parameter Computational Geometry 2018 workshop (Lorentz Centre, NL). It appeared in ICALP 2019 (CORE A Conference, acceptance rate 29%) and is published (by invitation) in the special issue of Discrete & Computational Geometry (Springer) in memory of Ricky Pollack. As this paper initiates the study of this problem, follow-up research on better and faster approximation algorithms is anticipated.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
