Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems-Reference-Cited by-同舟云学术

Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems

Published:1984-06-26 Issue:3 Volume:31 Page:459-473
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Gurevich Yuri¹,Stockmeyer Larry²,Vishkin Uzi³

Affiliation:

1. Department of Computer and Communication Sciences, University of Michigan, Ann Arbor, MI

2. IBM Research Lab. K51/281, 5600 Cottle Road, San Jose, CA

3. Department of Computer Science, Courant Institute of Mathematical Sciences, 251 Mercer Street, New York, NY

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Reference20 articles.

1. The Parallel Evaluation of General Arithmetic Expressions

2. on tree networks: p-centre and n-dispersion problems;CHANDRASEKARAN R.;Math. Oper. Res

3. CHRISTOFIDES N. AND VIOLA P.The optimum location of multi-centres on a graph. Oper Res Quarterly 22 (t 97 l) 145-154. CHRISTOFIDES N. AND VIOLA P.The optimum location of multi-centres on a graph. Oper Res Quarterly 22 (t 97 l) 145-154.

4. COPPERSMITH D. AND VISHKIN U. Solving NP-hard problems on almost trees: Vertex cover. Report RC 9404 IBM Thomas J. Watson Research Center Yorktown Heights N. Y. 1982. COPPERSMITH D. AND VISHKIN U. Solving NP-hard problems on almost trees: Vertex cover. Report RC 9404 IBM Thomas J. Watson Research Center Yorktown Heights N. Y. 1982.

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

1. On 1-Skeleton of the Cut Polytopes;Lecture Notes in Computer Science;2024

2. Continuous covering on networks: Improved mixed integer programming formulations;Omega;2023-06

3. Succinct Data Structures for SP, Block-Cactus and 3-Leaf Power Graphs;International Journal of Foundations of Computer Science;2023-04-21

4. Succinct Data Structures for Series-Parallel, Block-Cactus and 3-Leaf Power Graphs;Combinatorial Optimization and Applications;2021

5. Covering edges in networks;Networks;2020-01-07