Socially fair network design via iterative rounding
type: Item
instance of: scholarly article
title: Socially fair network design via iterative rounding
author: Aditi Laddha
author: Mohit Singh
author: Santosh S. Vempala
published in: Operations Research Letters
publication date: 2022-10-17T00:00:00Z
Mathematics Subject Classification ID: 90-XX
zbMATH DE Number: 7602476
zbMATH Keywords: approximation algorithm
zbMATH Keywords: iterative rounding
zbMATH Keywords: network design
MaRDI profile type: Publication
full work available at URL: j.orl.2022.07.011
OpenAlex ID: W4289597524
cites work: Simultaneous Approximation of Constraint Satisfaction Problems
cites work: Q4607982
cites work: Pareto optimality, game theory and equilibria
cites work: Q3309761
cites work: Q3128880
cites work: Iterative Rounding for Multi-Objective Optimization Problems
cites work: New approaches to multi-objective optimization
cites work: A factor 2 approximation algorithm for the generalized Steiner network problem
cites work: On the approximability of minmax (regret) network optimization problems
cites work: Iterative Methods in Combinatorial Optimization
cites work: Simpler analysis of LP extreme points for traveling salesman and survivable network design problems
cites work: Many birds with one stone
cites work: Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal
DOI: 10.1016/J.ORL.2022.07.011
description: scientific article; zbMATH DE number 7602476