Fast geometric approximation techniques and geometric embedding problems
Authors:
- Marshall W. BernMBMarshall W. Bern
- Howard J. KarloffHKHoward J. Karloff
- Prabhakar RaghavanPRPrabhakar Raghavan
- Baruch SchieberBSBaruch Schieber
- 1 December 1992
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 106 (2) , 265-281
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Approximation algorithms for geometric embeddings in the plane with applications to parallel processing problems1989
- Minimum Spanning Trees in k-Dimensional SpaceSIAM Journal on Computing, 1988
- Parallel comparison algorithms for approximation problems1988
- Fibonacci heaps and their uses in improved network optimization algorithmsJournal of the ACM, 1987
- Graphs whose every transitive orientation contains almost every relationIsrael Journal of Mathematics, 1987
- Wafer-Scale Integration of Systolic ArraysIEEE Transactions on Computers, 1985
- On optimal linear arrangements of treesComputers & Mathematics with Applications, 1984
- Upper bounds for sorting integers on random access machinesTheoretical Computer Science, 1983
- The complexity of restricted spanning tree problemsJournal of the ACM, 1982
- Approximation algorithms for convex hullsCommunications of the ACM, 1982