Directed Multicut is W[1]-hard, Even for Four Terminal Pairs
- Submitting institution
-
Royal Holloway and Bedford New College
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 33978194
- Type
- D - Journal article
- DOI
-
10.1145/3201775
- Title of journal
- ACM Transactions on Computation Theory (TOCT)
- Article number
- 13
- First page
- 1
- Volume
- 10
- Issue
- 3
- ISSN
- 1942-3454
- Open access status
- Compliant
- Month of publication
- May
- Year of publication
- 2018
- 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
- 6
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- "This paper shows the FPT intractability of a natural graph problem, settling an open question originally asked by Marx and Razgon in 2010 (arXiv 2010, STOC 2011/SICOMP 2014), thereby settling one of the major remaining questions in the area of FPT algorithms for graph-cut problems. The construction used in the hardness reduction was further used by Lokshtanov et al. (SODA 2020) in settling further open problems in the area. This paper is the journal version of a paper from SODA 2016.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -