One-sided discrete terrain guarding and chordal graphs
From MaRDI portal
Publication:831703
Cites work
- scientific article; zbMATH DE number 6297811 (Why is no real title available?)
- A 4-Approximation Algorithm for Guarding 1.5-Dimensional Terrains
- A Constant‐Factor Approximation Algorithm for Optimal 1.5D Terrain Guarding
- A fixed-parameter algorithm for guarding 1.5D terrains
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
- Characterizations of strongly chordal graphs
- Exact algorithms for terrain guarding
- Guarding terrains via local search
- Improved approximation algorithms for geometric set cover
- Improved approximations for guarding 1.5-dimensional terrains
- On guarding the vertices of rectilinear domains
- Parameter analysis for guarding terrains
- The continuous 1.5D terrain guarding problem: discretization, optimal solutions, and PTAS
This page was built for publication: One-sided discrete terrain guarding and chordal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q831703)