Login / Signup
Approximation algorithms for computing partitions with minimum stabbing number of rectilinear and simple polygons.
Mohammad Ali Abam
Boris Aronov
Mark de Berg
Amirali Khosravi
Published in:
SCG (2011)
Keyphrases
</>
approximation algorithms
constant factor
minimum cost
np hard
worst case
special case
lower bound
linear programming
set cover
facility location problem
constant factor approximation
clustering algorithm
finite number
spanning tree
network design problem
np hardness