One-sided discrete terrain guarding and chordal graphs
From MaRDI portal
Publication:831703
DOI10.1007/978-3-030-67899-9_10OpenAlexW3128357451MaRDI QIDQ831703
Kasthurirangan Prahlad Narasimhan
Publication date: 24 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-67899-9_10
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Improved approximations for guarding 1.5-dimensional terrains
- Improved approximation algorithms for geometric set cover
- Characterizations of strongly chordal graphs
- Parameter analysis for guarding terrains
- A fixed-parameter algorithm for guarding 1.5D terrains
- On guarding the vertices of rectilinear domains
- Guarding terrains via local search
- A 4-Approximation Algorithm for Guarding 1.5-Dimensional Terrains
- Exact Algorithms for Terrain Guarding
- A Constant‐Factor Approximation Algorithm for Optimal 1.5D Terrain Guarding
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
This page was built for publication: One-sided discrete terrain guarding and chordal graphs