An approximation algorithm for network design problems with downwards-monotone demand functions

Michael Laszlo, Sumitra Mukherjee
<span title="2007-04-28">2007</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="" style="color: black;">Optimization Letters</a> </i> &nbsp;
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.
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="">doi:10.1007/s11590-007-0051-8</a> <a target="_blank" rel="external noopener" href="">fatcat:bgmm2aqicbczxf4kdin7bok64e</a> </span>
<a target="_blank" rel="noopener" href="" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href=""> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> </button> </a>