Socially fair network design via iterative rounding

DOI10.1016/j.orl.2022.07.011OpenAlexW4289597524MaRDI QIDQ2084030

Santosh Vempala, Aditi Laddha, Mohit Singh

Publication date: 17 October 2022

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

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

zbMATH Keywords

approximation algorithmnetwork designiterative rounding

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• New approaches to multi-objective optimization
• A factor 2 approximation algorithm for the generalized Steiner network problem
• Pareto optimality, game theory and equilibria
• Simpler analysis of LP extreme points for traveling salesman and survivable network design problems
• On the approximability of minmax (regret) network optimization problems
• Iterative Methods in Combinatorial Optimization
• Simultaneous Approximation of Constraint Satisfaction Problems
• Iterative Rounding for Multi-Objective Optimization Problems
• Many birds with one stone
• Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal

This page was built for publication: Socially fair network design via iterative rounding