APPROXIMATING MINIMUM COST MULTIGRAPHS OF SPECIFIED EDGE-CONNECTIVITY UNDER DEGREE BOUNDS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)-Reference-Cited by-同舟云学术

APPROXIMATING MINIMUM COST MULTIGRAPHS OF SPECIFIED EDGE-CONNECTIVITY UNDER DEGREE BOUNDS(the 50th Anniversary of the Operations Research Society of Japan)

Published:2007 Issue:4 Volume:50 Page:339-349
ISSN:0453-4514
Container-title:Journal of the Operations Research Society of Japan
language:en
Short-container-title:JORSJ

Author:

Fukunaga Takuro¹,Nagamochi Hiroshi¹

Affiliation:

1. Kyoto University

Publisher

The Operations Research Society of Japan

Subject

Management Science and Operations Research,General Decision Sciences

Link

https://www.jstage.jst.go.jp/article/jorsj/50/4/50_KJ00004805414/_pdf

Reference14 articles.

1. 1) CHRISTOFIDES N. Worst-case analysis of a new heuristics for the traveling salesman problem. Graduate School of Industrial Administration, Carnegie-Mellon University. (1976)

2. 2) FUKUNAGA T. Network design with edge-connectivity and degree constraints. Proceedings of Fourth Workshop on Approximation and Online Algorithms, 2006. (2006)

3. 3) GOEMANS M. X. The primal-dual method for approximation algorithms and its application to network design problems. Approximation Algorithms for NP-Hard Problems. PWS. (1997)

4. 4) JAIN K. A factor 2 approximation algorithm for the generalized Steiner network problem. Combinatorica. (2001) vol.21, p.39-60.

5. 5) LAU L. C. Survivable network design with degree or order constraints. Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing, 2007. (2007)

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

1. Eulerian detachments with local edge-connectivity;Discrete Applied Mathematics;2009-02

2. Network Design with Edge-Connectivity and Degree Constraints;Theory of Computing Systems;2008-10-15