Approximation algorithms for covering a graph by vertex-disjoint paths of maximum total weight.
Shlomo MoranIlan NewmanYaron WolfstahlPublished in: Networks (1990)
Keyphrases
- disjoint paths
- total weight
- approximation algorithms
- undirected graph
- edge weights
- directed graph
- np hard
- minimum cost
- special case
- worst case
- spanning tree
- vertex cover
- weighted graph
- directed acyclic graph
- minimum weight
- approximation ratio
- facility location problem
- shortest path
- graph structure
- bipartite graph
- open shop
- set cover
- constant factor
- randomized algorithms
- combinatorial auctions
- primal dual
- complex networks
- constant factor approximation
- data structure
- polynomial time approximation
- precedence constraints
- random walk
- computational complexity