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.2019.22
URN: urn:nbn:de:0030-drops-114833
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2019/11483/
Go to the corresponding LIPIcs Volume Portal

Iwata, Yoichi ; Kobayashi, Yusuke

Improved Analysis of Highest-Degree Branching for Feedback Vertex Set

pdf-format:
LIPIcs-IPEC-2019-22.pdf (0.5 MB)

Abstract

Recent empirical evaluations of exact algorithms for Feedback Vertex Set have demonstrated the efficiency of a highest-degree branching algorithm with a degree-based pruning heuristic. In this paper, we prove that this empirically fast algorithm runs in O(3.460^k n) time, where k is the solution size. This improves the previous best O(3.619^k n)-time deterministic algorithm obtained by Kociumaka and Pilipczuk (Inf. Process. Lett., 2014).

BibTeX - Entry

@InProceedings{iwata_et_al:LIPIcs:2019:11483,
  author =	{Yoichi Iwata and Yusuke Kobayashi},
  title =	{{Improved Analysis of Highest-Degree Branching for Feedback Vertex Set}},
  booktitle =	{14th International Symposium on Parameterized and Exact Computation (IPEC 2019)},
  pages =	{22:1--22:11},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-129-0},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{148},
  editor =	{Bart M. P. Jansen and Jan Arne Telle},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2019/11483},
  URN =		{urn:nbn:de:0030-drops-114833},
  doi =		{10.4230/LIPIcs.IPEC.2019.22},
  annote =	{Keywords: Feedback Vertex Set, Branch and bound, Measure and conquer}
}

Keywords: Feedback Vertex Set, Branch and bound, Measure and conquer
Collection: 14th International Symposium on Parameterized and Exact Computation (IPEC 2019)
Issue Date: 2019
Date of publication: 04.12.2019

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