English

Simple PTAS's for families of graphs excluding a minor

Data Structures and Algorithms 2016-01-07 v2 Discrete Mathematics
Authors: Sergio Cabello , David Gajser
View on arXiv ↗ PDF ↗ DOI ↗

Abstract

We show that very simple algorithms based on local search are polynomial-time approximation schemes for Maximum Independent Set, Minimum Vertex Cover and Minimum Dominating Set, when the input graphs have a fixed forbidden minor.

Keywords

polynomial-time approximation schemes local search maximum independent set minimum vertex cover minimum dominating set forbidden minor graph families

Cite

@article{arxiv.1410.5778,
  title  = {Simple PTAS's for families of graphs excluding a minor},
  author = {Sergio Cabello and David Gajser},
  journal= {arXiv preprint arXiv:1410.5778},
  year   = {2016}
}

Comments

To appear in Discrete Applied Mathematics

Related papers

View all related →
Data Structures and Algorithms · Computer Science
Local search yields approximation schemes for k-means and k-median in Euclidean and minor-free metrics
Vincent Cohen-Addad, Philip N. Klein, Claire Mathieu
2016-04-08
Computational Geometry · Computer Science
Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs
Sariel Har-Peled, Kent Quanrud
2016-06-01
Distributed, Parallel, and Cluster Computing · Computer Science
Local Constant Approximation for Dominating Set on Graphs Excluding Large Minors
Marthe Bonamy, Cyril Gavoille, Timothé Picavet, Alexandra Wesolek
2025-05-14
Computational Geometry · Computer Science
Approximation Algorithms for Maximum Independent Set of Pseudo-Disks
Timothy M. Chan, Sariel Har-Peled
2011-03-09
Distributed, Parallel, and Cluster Computing · Computer Science
Distributed Dominating Set Approximations beyond Planar Graphs
Saeed Akhoondian Amiri, Stefan Schmid, Sebastian Siebertz
2019-04-18
Distributed, Parallel, and Cluster Computing · Computer Science
A tight local algorithm for the minimum dominating set problem in outerplanar graphs
Marthe Bonamy, Linda Cook, Carla Groenland, Alexandra Wesolek
2022-11-22
Data Structures and Algorithms · Computer Science
QPTAS for MWIS and finding large sparse induced subgraphs in graphs with few independent long holes
Édouard Bonnet, Jadwiga Czyżewska, Tomáš Masařík, Marcin Pilipczuk +1
2026-02-23
Data Structures and Algorithms · Computer Science
Local Search is a PTAS for Feedback Vertex Set in Minor-free Graphs
Hung Le, Baigong Zheng
2019-06-04
Data Structures and Algorithms · Computer Science
A Polynomial-Time Approximation Algorithm for Complete Interval Minors
Romain Bourneuf, Julien Cocquet, Chaoliang Tang, Stéphan Thomassé
2025-05-12
Combinatorics · Mathematics
Minimal separators in graph classes defined by small forbidden induced subgraphs
Martin Milanič, Nevena Pivač
2019-06-03
Discrete Mathematics · Computer Science
Thin graph classes and polynomial-time approximation schemes
Zdeněk Dvořák
2017-04-04
Optimization and Control · Mathematics
An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex
Etienne de Klerk, Monique Laurent, Zhao Sun
2014-10-29
Combinatorics · Mathematics
Local tree-width, excluded minors, and approximation algorithms
Martin Grohe
2007-05-23
Computational Geometry · Computer Science
A Framework for Approximation Schemes on Disk Graphs
Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue +1
2022-11-08
Quantum Physics · Physics
Covering a Graph with Minimal Local Sets
Nathan Claudet, Simon Perdrix
2025-09-09
Distributed, Parallel, and Cluster Computing · Computer Science
A local constant factor approximation for the minimum dominating set problem on bounded genus graphs
Saeed Akhoondian Amiri, Stefan Schmid, Sebastian Siebertz
2016-02-15
Data Structures and Algorithms · Computer Science
Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs
Michał Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese
2018-07-23
Discrete Mathematics · Computer Science
Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs
Glencora Borradaile, Erik D. Demaine, Siamak Tazari
2011-03-02
Distributed, Parallel, and Cluster Computing · Computer Science
Distributed Approximation Algorithms for Minimum Dominating Set in Locally Nice Graphs
Marthe Bonamy, Cyril Gavoille, Timothé Picavet, Alexandra Wesolek
2025-07-08
Data Structures and Algorithms · Computer Science
All Maximal Independent Sets and Dynamic Dominance for Sparse Graphs
David Eppstein
2010-01-11
Discrete Mathematics · Computer Science
Baker game and polynomial-time approximation schemes
Zdeněk Dvořák
2019-01-08
Computational Geometry · Computer Science
Approximately: Independence Implies Vertex Cover
Sariel Har-Peled
2026-02-23
Data Structures and Algorithms · Computer Science
Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search
Barış Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen +1
2026-01-13
Data Structures and Algorithms · Computer Science
A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set
Serge Gaspers, Mathieu Liedloff
2010-09-08
Data Structures and Algorithms · Computer Science
Exploiting Reduction Rules and Data Structures: Local Search for Minimum Vertex Cover in Massive Graphs
Yi Fan, Chengqian Li, Zongjie Ma, LjiLjana Brankovic +2
2015-09-22