Lower bounds for computing geometric spanners and approximate shortest paths

Chen, Danny Z.; Das, Gautam; Smid, Michiel

Item

ITEM ACTIONSEXPORT

Add to Basket

Please note that a newer version of this item is available:
https://pure.mpg.de/pubman/item/item_1331701_4

DetailsSummary

Lower bounds for computing geometric spanners and approximate shortest paths

Chen, D. Z., Das, G., & Smid, M. (1996). Lower bounds for computing geometric spanners and approximate shortest paths. In 8th Canadian Conference on Computing (pp. 155-160). -: Carleton.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AB7D-4 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AB7E-2

Genre: Conference Paper

Files

show Files

Locators

show

Creators

show

hide

Creators:
Chen, Danny Z., Author
Das, Gautam¹, Author
Smid, Michiel¹, Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

Details

show

hide

Language(s): eng - English

Dates: Modified: 2010-03-02Date issued: 1996

Publication Status: Issued

Pages: -

Publishing info: - : Carleton

Table of Contents: -

Rev. Type: -

Identifiers: eDoc: 517750
Other: Local-ID: C1256428004B93B8-5468590C0DFFEFCEC125648F00326654-Chen-Das-Smid96

Degree: -

Event

show

hide

Title: Untitled Event

Place of Event: Ottawa, Canada

Start-/End Date: 1996

Legal Case

show

Project information

show

Source 1

show

hide

Title: 8th Canadian Conference on Computing

Source Genre: Proceedings

Creator(s):

Affiliations:

Publ. Info: - : Carleton

Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 155 - 160 Identifier: -