SIGN IN
SIGN UP
Computing shortest transversals of sets (extended abstract)
Full Text:
PDF
Buy this Article
Authors:
Binay Bhattacharya
School of Computing Science, Simon Fraser University, Burnaby, British Columbia, Canada V5A 1S6
Jurek Czyzowicz
Département d'Informatique, Université du Québec à Hull, Hull, Québec, Canada J8X 3X7
Peter Egyed
School of computer Science, McGill University, Montreal, Quebec, Canada H3A 2A7
Ivan Stojmenovic
Department of Computer Science, University of Ottawa, Ottawa, Ontario, Canada K1N 6N5
Godfried Toussaint
School of computer Science, McGill University, Montreal, Quebec, Canada H3A 2A7
Jorge Urrutia
Department of Computer Science, University of Ottawa, Ottawa, Ontario, Canada K1N 6N5
1991 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 8
· Downloads (cumulative): 218
· Citation Count: 2
Published in:
· Proceeding
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Pages 71-80
ACM
New York, NY
, USA
©1991
table of contents
ISBN:0-89791-426-0
doi>
10.1145/109648.109656
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
SoCG '13
Share:
|
Tags:
algorithms
geometrical problems and computations
optimization
theory
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder