Login / Signup
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors.
Erik D. Demaine
Mohammad Taghi Hajiaghayi
Naomi Nishimura
Prabhakar Ragde
Dimitrios M. Thilikos
Published in:
J. Comput. Syst. Sci. (2004)
Keyphrases
</>
approximation algorithms
undirected graph
np hard
directed graph
special case
worst case
graph structure
approximation ratio
weighted graph
graph matching
network design problem
facility location problem
vertex cover
minimum cost
approximation schemes
open shop