On generalizations of network design problems with degree bounds-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

On generalizations of network design problems with degree bounds

Published:2012-04-05 Issue:1-2 Volume:141 Page:479-506
ISSN:0025-5610
Container-title:Mathematical Programming
language:en
Short-container-title:Math. Program.

Author:

Bansal Nikhil,Khandekar Rohit,Könemann Jochen,Nagarajan Viswanath,Peis Britta

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,Software

Link

http://link.springer.com/content/pdf/10.1007/s10107-012-0537-8.pdf

Reference33 articles.

1. Anthony B., Goyal V., Gupta A., Nagarajan V.: A plant location guide for the unsure: approximation algorithms for min–max location problems. Math. Oper. Res. 35, 79–101 (2010)

2. Arora S., Babai L., Stern J., Sweedyk Z.: The hardness of approximate optima in lattices, codes, and systems of linear equations. J. Comput. Syst. Sci. 54(2), 317–331 (1997)

3. Arya V., Garg N., Khandekar R., Meyerson A., Munagala K., Pandit V.: Local search heuristics for k-median and facility location problems. SIAM J. Comput. 33(3), 544–562 (2004)

4. Bansal N., Khandekar R., Nagarajan V.: Additive guarantees for degree-bounded directed network design. SIAM J. Comput. 39(4), 1413–1431 (2009)

5. Bansal, N., Khandekar, R., Könemann, J., Nagarajan, V., Peis, B.: On generalizations of network design problems with degree bounds. In: Proceedings of Integer Programming Combinatorial Optimization (IPCO), pp. 110–123 (2010)

Cited by 20 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Parameterized Approximation Schemes for Clustering with General Norm Objectives;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

2. Thin Trees for Laminar Families;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

3. A New Dynamic Programming Approach for Spanning Trees with Chain Constraints and Beyond;Mathematics of Operations Research;2023-10-13

4. A 3/2-Approximation for the Metric Many-Visits Path TSP;SIAM Journal on Discrete Mathematics;2022-12

5. A Spectral Approach to Network Design;SIAM Journal on Computing;2022-07-13

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3