License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.IPEC.2017.12
URN: urn:nbn:de:0030-drops-85470
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/8547/
Go to the corresponding LIPIcs Volume Portal

Chandrasekaran, Karthekeyan ; Mozaffari, Sahand

Odd Multiway Cut in Directed Acyclic Graphs

pdf-format:
LIPIcs-IPEC-2017-12.pdf (0.6 MB)

Abstract

We investigate the odd multiway node (edge) cut problem where the input is a graph with a specified collection of terminal nodes and the goal is to find a smallest subset of non-terminal nodes (edges) to delete so that the terminal nodes do not have an odd length path between them. In an earlier work, Lokshtanov and Ramanujan showed that both odd multiway node cut and odd multiway edge cut are fixed-parameter tractable (FPT) when parameterized by the size of the solution in undirected graphs. In this work, we focus on directed acyclic graphs (DAGs) and design a fixed-parameter algorithm. Our main contribution is an extension of the shadow-removal framework for parity problems in DAGs. We complement our FPT results with tight approximability as well as polyhedral results for 2 terminals in DAGs. Additionally, we show inapproximability results for odd multiway edge cut in undirected graphs even for 2 terminals.

BibTeX - Entry

@InProceedings{chandrasekaran_et_al:LIPIcs:2018:8547,
  author =	{Karthekeyan Chandrasekaran and Sahand Mozaffari},
  title =	{{Odd Multiway Cut in Directed Acyclic Graphs}},
  booktitle =	{12th International Symposium on Parameterized and Exact Computation (IPEC 2017)},
  pages =	{12:1--12:12},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-051-4},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{89},
  editor =	{Daniel Lokshtanov and Naomi Nishimura},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/8547},
  URN =		{urn:nbn:de:0030-drops-85470},
  doi =		{10.4230/LIPIcs.IPEC.2017.12},
  annote =	{Keywords: Odd Multiway Cut, Fixed-Parameter Tractability, Approximation Algorithms}
}

Keywords: Odd Multiway Cut, Fixed-Parameter Tractability, Approximation Algorithms
Collection: 12th International Symposium on Parameterized and Exact Computation (IPEC 2017)
Issue Date: 2018
Date of publication: 02.03.2018

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI