Min-Max Latency Walks: Approximation Algorithms for Monitoring Vertex-Weighted Graphs
Soroush AlamdariElaheh FataStephen L. SmithPublished in: CoRR (2012)
Keyphrases
- approximation algorithms
- min max
- weighted graph
- minimum weight
- edge weights
- undirected graph
- vertex set
- np hard
- special case
- shortest path
- vertex cover
- graph model
- worst case
- set cover
- graph partitioning
- minimum cost
- spanning tree
- approximation ratio
- regularization framework
- discrete data
- open shop
- constant factor
- randomized algorithms
- data objects
- disjoint paths
- graph connectivity
- constant factor approximation
- scheduling problem
- learning algorithm
- linear programming