Approximation algorithms for the graph balancing problem with two speeds and two job lengths.
Daniel R. PageRoberto Solis-ObaPublished in: J. Comb. Optim. (2019)
Keyphrases
- approximation algorithms
- undirected graph
- np hard
- disjoint paths
- constant factor
- special case
- vertex cover
- worst case
- minimum cost
- facility location problem
- graph model
- primal dual
- approximation ratio
- set cover
- graph structure
- network design problem
- np hardness
- directed graph
- planar graphs
- spanning tree
- randomized algorithms
- open shop
- combinatorial auctions
- precedence constraints
- random walk
- single machine scheduling problem
- weighted graph
- bipartite graph
- graphical models
- convex hull