Approximation Algorithms for Multi-budgeted Network Design Problems

DOI10.1007/978-3-319-25258-2_10zbMath1471.68324OpenAlexW2293554661MaRDI QIDQ3460712

Georgios Stamoulis

Publication date: 8 January 2016

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-25258-2_10

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A factor 2 approximation algorithm for the generalized Steiner network problem
• Simpler analysis of LP extreme points for traveling salesman and survivable network design problems
• A primal-dual approximation algorithm for generalized Steiner network problems
• Iterative Methods in Combinatorial Optimization
• Survivable network design with degree or order constraints
• Improved Algorithm for Degree Bounded Survivable Network Design Problem
• On the L  ∞ -Norm of Extreme Points for Crossing Supermodular Directed Network LPs
• Algorithms for a network design problem with crossing supermodular demands
• Computing and Combinatorics

This page was built for publication: Approximation Algorithms for Multi-budgeted Network Design Problems