Approximation Algorithms for Domination Search

DOI10.1007/978-3-642-18318-8_12zbMath1314.68396OpenAlexW1815091391WikidataQ60488544 ScholiaQ60488544MaRDI QIDQ3075456

Dimitrios M. Thilikos, Fedor V. Fomin, Petr A. Golovach

Publication date: 15 February 2011

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-18318-8_12

zbMATH Keywords

approximation algorithmsgraph minorsdomination search

Mathematics Subject Classification ID

Graph minors (05C83) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (2)

DAG-width is PSPACE-complete ⋮ Contraction obstructions for treewidth

This page was built for publication: Approximation Algorithms for Domination Search