One-sided discrete terrain guarding and chordal graphs

DOI10.1007/978-3-030-67899-9_10OpenAlexW3128357451MaRDI QIDQ831703FDOQ831703

Kasthurirangan Prahlad Narasimhan

Publication date: 24 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-67899-9_10

zbMATH Keywords

chordal graphsvisibility graphsterrain guarding

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On guarding the vertices of rectilinear domains
• Characterizations of strongly chordal graphs
• Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
• Improved approximation algorithms for geometric set cover
• A fixed-parameter algorithm for guarding 1.5D terrains
• A 4-Approximation Algorithm for Guarding 1.5-Dimensional Terrains
• Improved approximations for guarding 1.5-dimensional terrains
• A Constant‐Factor Approximation Algorithm for Optimal 1.5D Terrain Guarding
• Guarding terrains via local search
• Parameter analysis for guarding terrains
• Exact Algorithms for Terrain Guarding

Cited In (1)

• One-sided terrain guarding and chordal graphs

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)