Exact algorithms for a discrete metric labeling problem
From MaRDI portal
Publication:5920404
DOI10.1016/j.disopt.2006.05.009zbMath1130.05025MaRDI QIDQ5920404
Gaia Nicosia, Andrea Pacifici, Arianna Alfieri
Publication date: 11 January 2008
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2006.05.009
90C35: Programming involving graphs or networks
68R10: Graph theory (including graph drawing) in computer science
05C15: Coloring of graphs and hypergraphs
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
The shortest connection game, Solving Graph Partitioning Problems Arising in Tagless Cache Management
Cites Work
- On rigid circuit graphs
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- On weighted multiway cuts in trees
- Evolutionary trees: An integer multicommodity max-flow -- min-cut theorem
- Approximation algorithms for classification problems with pairwise relationships
- Complexity of Finding Embeddings in a k-Tree
- Graph Classes: A Survey
- The Complexity of Multiterminal Cuts
- Unnamed Item
- Unnamed Item