Algorithms for a network design problem with crossing supermodular demands
From MaRDI portal
Publication:4474300
DOI10.1002/net.20005zbMath1053.90013MaRDI QIDQ4474300
Publication date: 4 August 2004
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20005
linear programming; approximation algorithms; basic solutions; network design problems; crossing supermodular functions
90C10: Integer programming
90B10: Deterministic network models in operations research
68W25: Approximation algorithms
Related Items
Approximating directed weighted-degree constrained networks, LP-based solution methods for the asymmetric TSP, On the \(L_{\infty}\)-norm of extreme points for crossing supermodular directed network LPs, The \(k\)-path tree matroid and its applications to survivable network design, Approximating the smallest k -edge connected spanning subgraph by LP-rounding, Approximation Algorithms for Multi-budgeted Network Design Problems, Approximating Directed Weighted-Degree Constrained Networks
Cites Work