AI Chat AI Image Generator AI Video Text to Speech

A PTAS for vertex guarding weakly-visible polygons - An extended abstract

03/06/2018

∙

by Matthew J. Katz, et al.

∙

∙

In this extended abstract, we first present a PTAS for guarding the vertices of a weakly-visible polygon P from a subset of its vertices, or in other words, a PTAS for computing a minimum dominating set of the visibility graph of the vertices of P. We then show how to obtain a PTAS for vertex guarding the entire polygon.

page 1

page 2

page 3

page 4

research

∙ 09/29/2021

Connected domination in grid graphs

Given an undirected simple graph, a subset of the vertices of the graph ...

0 Masahisa Goto, et al. ∙

research

∙ 07/02/2019

A Constant-Factor Approximation Algorithm for Vertex Guarding a WV-Polygon

The problem of vertex guarding a simple polygon was first studied by Sub...

0 Stav Ashur, et al. ∙

research

∙ 02/20/2021

On guarding polygons with holes

There is an old conjecture by Shermer <cit.> that in a polygon with n ve...

0 Sharareh Alipour, et al. ∙

research

∙ 10/27/2016

The Probabilistic Model Checker Storm (Extended Abstract)

We present a new probabilistic model checker Storm. Using state-of-the-a...

0 Christian Dehnert, et al. ∙

research

∙ 03/11/2021

Terrain prickliness: theoretical grounds for low complexity viewsheds

An important task when working with terrain models is computing viewshed...

0 Ankush Acharyya, et al. ∙

research

∙ 08/28/2023

Mutual visibility in hypercube-like graphs

Let G be a graph and X⊆ V(G). Then, vertices x and y of G are X-visible ...

0 Serafino Cicerone, et al. ∙

research

∙ 02/20/2018

The Cut and Dominating Set Problem in A Steganographer Network

A steganographer network corresponds to a graphic structure that the inv...

0 Hanzhou Wu, et al. ∙