Approximation algorithms for multi-budgeted network design problems

DOI10.1007/978-3-319-25258-2_10MaRDI QIDQ3460712zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Computing and Combinatorics
• scientific article; zbMATH DE number 1003253
• Cut problems in graphs with a budget constraint
• Cut Problems in Graphs with a Budget Constraint
• Approximation Algorithms for Network Design Problems on Bounded Subsets

Cites work

• A factor 2 approximation algorithm for the generalized Steiner network problem
• A primal-dual approximation algorithm for generalized Steiner network problems
• Algorithms for a network design problem with crossing supermodular demands
• Computing and Combinatorics
• scientific article; zbMATH DE number 1003253 (Why is no real title available?)
• scientific article; zbMATH DE number 1234104 (Why is no real title available?)
• scientific article; zbMATH DE number 1445363 (Why is no real title available?)
• scientific article; zbMATH DE number 5485590 (Why is no real title available?)
• Improved algorithm for degree bounded survivable network design problem
• Iterative methods in combinatorial optimization.
• On the L  ∞ -Norm of Extreme Points for Crossing Supermodular Directed Network LPs
• Simpler analysis of LP extreme points for traveling salesman and survivable network design problems
• Survivable network design with degree or order constraints

Cited in

(5)

• Algorithms for a multi-level network optimization problem
• Algorithms for the non-bifurcated network design problem
• Approximation Schemes for Multi-Budgeted Independence Systems
• Algorithms for a network design problem with crossing supermodular demands
• Multistage graph problems on a global budget

This page was built for publication: Approximation algorithms for multi-budgeted network design problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3460712)