Geometric algorithms for a minimum cost assignment problem

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Geometric algorithms for a minimum cost assignment problem

Full text

Pdf (635 KB)

Source

Annual Symposium on Computational Geometry archive
Proceedings of the seventh annual symposium on Computational geometry table of contents

North Conway, New Hampshire, United States

Pages: 262 - 271

Year of Publication: 1991

ISBN:0-89791-426-0

Authors

Takeshi Tokuyama	IBM Research, Tokyo Research Laboratory, 5-11 Sanbancho, Chiyoda-ku, Tokyo 102, Japan
Jun Nakano	IBM Research, Tokyo Research Laboratory, 5-11 Sanbancho, Chiyoda-ku, Tokyo 102, Japan

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 7, Downloads (12 Months): 26, Citation Count: 3

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/109648.109678 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	AE	Avis, D., E1Gindy, H., "Triangulating point sets in space" Discrete Comput. Geom. 2, pp.99-111, 1987.
	CLR	Thomas T. Cormen , Charles E. Leiserson , Ronald L. Rivest, Introduction to algorithms, MIT Press, Cambridge, MA, 1990
	CW	D. Coppersmith , S. Winograd, Matrix multiplication via arithmetic progressions, Proceedings of the nineteenth annual ACM conference on Theory of computing, p.1-6, January 1987, New York, New York, United States [doi>10.1145/28395.28396]
	F	Ford, L. and Fulkerson, D., Flows in Networks, Princeton University Press, 1962.
	FL	Robert W. Floyd , Ronald L. Rivest, Expected time bounds for selection, Communications of the ACM, v.18 n.3, p.165-172, March 1975 [doi>10.1145/360680.360691]
	FT	Michael L. Fredman , Robert Endre Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms, Journal of the ACM (JACM), v.34 n.3, p.596-615, July 1987 [doi>10.1145/28869.28874]
	GT	H. N. Gabow , R. E. Tarjan, Faster scaling algorithms for network problems, SIAM Journal on Computing, v.18 n.5, p.1013-1036, Oct. 1989 [doi>10.1137/0218069]
	NT	Kazumiti Numata , Takeshi Tokuyama, Splitting a configuration in a simplex, Proceedings of the international symposium on Algorithms, p.429-438, August 1990, Tokyo, Japan
	R	Raghavan, P., Lecture notes on randomized algorithms iBM Research Report RC15340, 1990

CITED BY 3

	Franz Aurenhammer , Friedrich Hoffman , Boris Aronov, Minkowski-type theorems and least-squares partitioning, Proceedings of the eighth annual symposium on Computational geometry, p.350-357, June 10-12, 1992, Berlin, Germany
	Takeshi Tokuyama , Jun Nakano, Efficient algorithms for the Hitchcock transportation problem, Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms, p.175-184, September 1992, Orlando, Florida, United States
	Nestor F. Michelena , Panos Y. Papalambros, A Hypergraph Framework for Optimal Model-Based Decomposition ofDesign Problems, Computational Optimization and Applications, v.8 n.2, p.173-196, Sept 1997