Approximation algorithms for orthogonal line centers.

Arun Kumar Das Sandip Das Joydeep Mukherjee

Published in: Discret. Appl. Math. (2023)

Keyphrases

approximation algorithms
np hard
special case
network design problem
worst case
minimum cost
vertex cover
facility location problem
open shop
precedence constraints
constant factor
approximation ratio
exact algorithms
primal dual
undirected graph
set cover
disjoint paths
np hardness
computational complexity