Hardness results and approximation algorithm for total liar's domination in graphs
DOI10.1007/S10878-012-9542-3zbMATH Open1297.90170OpenAlexW2170298940MaRDI QIDQ2015803FDOQ2015803
Authors: B. S. Panda, S. Paul 
Publication date: 24 June 2014
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-012-9542-3
Recommendations
- Hardness results, approximation and exact algorithms for liar's domination problem in graphs
- Liar's domination in graphs: complexity and algorithm
- Connected liar's domination in graphs: complexity and algorithms
- A linear time algorithm for liar's domination problem in proper interval graphs
- Liar's dominating sets in graphs
approximation algorithmgraph algorithmNP-completenessdominationchordal graphliar's dominationAPX-completeness
Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- Introduction to algorithms
- Reducibility among combinatorial problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some APX-completeness results for cubic graphs
- On the Algorithmic Complexity of Total Domination
- Total domination in graphs
- A survey of selected recent results on total domination in graphs
- Title not available (Why is that?)
- \(k\)-tuple total domination in graphs
- On domination problems for permutation and other graphs
- Title not available (Why is that?)
- \(k\)-tuple domination in graphs
- Approximation hardness of dominating set problems in bounded degree graphs
- Liar's domination in graphs
- Liar's domination
- Labeling algorithms for domination problems in sun-free chordal graphs
- Total domination in block graphs
- Algorithmic aspect of \(k\)-tuple domination in graphs.
- Hardness results and approximation algorithms of \(k\)-tuple domination in graphs
- Total domination in interval graphs
- Title not available (Why is that?)
- Double total domination of graphs
Cited In (8)
- A linear time algorithm for liar's domination problem in proper interval graphs
- Connected liar's domination in graphs: complexity and algorithms
- Various bounds for liar's domination number
- Fault tolerant detectors for distinguishing sets in graphs
- On the total liar's domination of graphs
- Hardness results, approximation and exact algorithms for liar's domination problem in graphs
- Liar's domination in graphs: complexity and algorithm
- Liar's domination in unit disk graphs
This page was built for publication: Hardness results and approximation algorithm for total liar's domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2015803)
