New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen.
Baruch AwerbuchYossi AzarAvrim BlumSantosh S. VempalaPublished in: SIAM J. Comput. (1998)
Keyphrases
- minimum weight
- prize collecting
- approximation guarantees
- greedy algorithm
- greedy heuristic
- tree patterns
- bipartite graph
- approximation algorithms
- randomized algorithm
- spanning tree
- np hard
- traveling salesman problem
- weighted graph
- minimum spanning tree
- objective function
- travel time
- lower bound
- approximation ratio
- social networks
- minimum cost
- tree structure
- query processing
- special case
- genetic algorithm
- shortest path
- computational complexity
- worst case
- upper bound