Approximating max-min weighted \(T\)-joins

DOI10.1016/j.orl.2013.03.004zbMath1286.90129OpenAlexW2073961376MaRDI QIDQ2450657

Satoru Iwata, R. Ravi

Publication date: 14 May 2014

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2013.03.004

zbMATH Keywords

bottleneck problem\(T\)-joinsmax-min optimization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Signed and weighted graphs (05C22)

Cites Work

• Unnamed Item
• Unnamed Item
• Geometric algorithms and combinatorial optimization
• Min-max optimization of several classical discrete optimization problems
• Conservative weightings and ear-decompositions of graphs
• Thresholded Covering Algorithms for Robust and Max-min Optimization
• An analysis of approximations for maximizing submodular set functions—I
• Matching, Euler tours and the Chinese postman
• A General Approximation Technique for Constrained Forest Problems
• Robust Combinatorial Optimization with Exponential Scenarios
• Complexity of finding a join of maximum weight

This page was built for publication: Approximating max-min weighted \(T\)-joins