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

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.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [18 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01740357
Contributor : Nabil Mustafa <>
Submitted on : Wednesday, March 21, 2018 - 8:13:02 PM
Last modification on : Thursday, July 5, 2018 - 2:29:12 PM
Document(s) archivé(s) le : Thursday, September 13, 2018 - 7:14:36 AM

File

radiuslocalsearch.pdf
Publisher files allowed on an open archive

Identifiers

Citation

Daniel Antunes, Claire Mathieu, Nabil Mustafa. Combinatorics of Local Search: An Optimal 4-Local Hall's Theorem for Planar Graphs. 25th Annual European Symposium on Algorithms (ESA 2017), Sep 2017, Vienna, Austria. ⟨10.4230/LIPIcs.ESA.2017.8⟩. ⟨hal-01740357⟩

Share

Metrics

Record views

178

Files downloads

36