Intractability of assembly sequencing: Unit disks in the plane-Reference-Cited by-同舟云学术

Intractability of assembly sequencing: Unit disks in the plane

Published:1997 Issue: Volume: Page:307-320
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Goldwasser Michael,Motwani Rajeev

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-63307-3_70

Reference47 articles.

1. P. Agarwal, M. de Berg, D. Halperin, and M. Sharir. Efficient generation of k-directional assembly sequences. In Proc. 7th ACM Symp. on Discrete Algorithms, pages 122–131, 1996.

2. S. Arora. Polynomial-time approximation schemes for Euclidean TSP and other geometric problems. In Proc. 37th Symp. on Found. Comput. Sci., pages 1–11, 1996.

3. S. Arora, L. Babai, J. Stern, and Z. Sweedyk. The hardness of approximate optima in lattices, codes and linear equations. In Proc. 34th Symp. on Found. Comput. Sci., pages 724–733, 1993.

4. S. Arora and C. Lund. Hardness of approximations. In D. Hochbaum, editor, Approximation Algorithms for NP-Hard Problems. PWS Publishing Company, Boston, MA, 1996.

5. B. Baker. Approximation algorithms for NP-complete problems on planar graphs. J. ACM, 41(1):153–180, 1994.

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

1. Scheduling AND/OR-Networks on Identical Parallel Machines;Approximation and Online Algorithms;2004

2. Minimum propositional proof length is NP-hard to linearly approximate;Journal of Symbolic Logic;2001-03

3. Approximation Algorithms for the Label-Cover MAX and Red-Blue Set Cover Problems;Algorithm Theory - SWAT 2000;2000

4. The Data Warehouse of Newsgroups;Lecture Notes in Computer Science;1999