Paper Info
Title
An approximation algorithm for network design problems with downwards-monotone demand functions
Abstract
Building on an existing 2-approximate algorithm for the class of network design problems with downwards-monotone demand functions, many of which are NP-hard, we present an algorithm that produces solutions that are at least as good as and typically better than solutions produced by the existing algorithm.
Year
DOI
Venue
2008
10.1007/s11590-007-0051-8
Optimization Letters
Keywords
Field
DocType
network design problems · approximation algorithms · spanning forests · integer programs,approximation algorithms,network design
Approximation algorithm,Mathematical optimization,Algorithm design,Network planning and design,Mathematics,Monotone polygon
Journal
Volume
Issue
ISSN
2
2
1862-4472
Citations 
PageRank 
References 
2
0.41
6
Authors
2
Name
Order
Citations
PageRank
Michael Laszlo121410.76
Sumitra Mukherjee231131.75