License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ESA.2017.8
URN: urn:nbn:de:0030-drops-78293
URL: http://drops.dagstuhl.de/opus/volltexte/2017/7829/
Go to the corresponding LIPIcs Volume Portal


Antunes, Daniel ; Mathieu, Claire ; Mustafa, Nabil H.

Combinatorics of Local Search: An Optimal 4-Local Hall's Theorem for Planar Graphs

pdf-format:
LIPIcs-ESA-2017-8.pdf (0.8 MB)


Abstract

Local search for combinatorial optimization problems is becoming a dominant algorithmic paradigm, with several papers using it to resolve long-standing open problems. In this paper, we prove the following `4-local' version of Hall's theorem for planar graphs: given a bipartite planar graph G = (B, R, E) such that |N(B')| >= |B'| for all |B'| <= 4, there exists a matching of size at least |B|/4 in G; furthermore this bound is tight. Besides immediately implying improved bounds for several problems studied in previous papers, we find this variant of Hall's theorem to be of independent interest in graph theory.

BibTeX - Entry

@InProceedings{antunes_et_al:LIPIcs:2017:7829,
  author =	{Daniel Antunes and Claire Mathieu and Nabil H. Mustafa},
  title =	{{Combinatorics of Local Search: An Optimal 4-Local Hall's Theorem for Planar Graphs}},
  booktitle =	{25th Annual European Symposium on Algorithms (ESA 2017)},
  pages =	{8:1--8:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-049-1},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{87},
  editor =	{Kirk Pruhs and Christian Sohler},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2017/7829},
  URN =		{urn:nbn:de:0030-drops-78293},
  doi =		{10.4230/LIPIcs.ESA.2017.8},
  annote =	{Keywords: Planar graphs, Local search, Hall's theorem, Combinatorial optimization, Expansion}
}

Keywords: Planar graphs, Local search, Hall's theorem, Combinatorial optimization, Expansion
Seminar: 25th Annual European Symposium on Algorithms (ESA 2017)
Issue Date: 2017
Date of publication: 31.08.2017


DROPS-Home | Fulltext Search | Imprint Published by LZI