Approximation algorithms for domination search

DOI10.1007/978-3-642-18318-8_12MaRDI QIDQ3075456zbMATH OpenOpenAlexWikidataFDO

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

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 algorithmsdomination searchgraph minors

Mathematics Subject Classification ID

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

Recommendations

• Distance \(d\)-domination games
• Complexity and monotonicity results for domination games
• On the domination search number
• scientific article; zbMATH DE number 1696531
• Graph-Theoretic Concepts in Computer Science

Cited in

(11)

• On the domination search number
• Contraction obstructions for treewidth
• scientific article; zbMATH DE number 1696531 (Why is no real title available?)
• scientific article; zbMATH DE number 5010630 (Why is no real title available?)
• DAG-width is PSPACE-complete
• scientific article; zbMATH DE number 1320677 (Why is no real title available?)
• Approximation algorithms for connected dominating sets
• Distance \(d\)-domination games
• Graph-Theoretic Concepts in Computer Science
• Approximation Algorithms and Hardness for Domination with Propagation
• Approximation algorithm for (connected) Italian dominating function

This page was built for publication: Approximation algorithms for domination search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3075456)