Liar’s Domination in 2D

DOI10.1007/978-3-319-53007-9_20zbMath1485.68270OpenAlexW2583101493MaRDI QIDQ2971650

Ramesh K. Jallu, Unnamed Author

Publication date: 7 April 2017

Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-53007-9_20

zbMATH Keywords

approximation algorithmdominating setunit disk graphliar's dominating set

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Approximation algorithms (68W25) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Unnamed Item
• Liar's dominating sets in graphs
• Liar's domination in graphs
• Liar's domination in graphs: complexity and algorithm
• Hardness results, approximation and exact algorithms for liar's domination problem in graphs
• A linear time algorithm for liar's domination problem in proper interval graphs
• APPROXIMATION ALGORITHMS FOR A VARIANT OF DISCRETE PIERCING SET PROBLEM FOR UNIT DISKS
• Liar's domination

This page was built for publication: Liar’s Domination in 2D