Memory-constrained Algorithms for Shortest Path Problem

Asano, Tetsuo; Doerr, Benjamin

Local TagsRelease HistoryDetailsSummary

Memory-constrained Algorithms for Shortest Path Problem

Asano, T., & Doerr, B. (2011). Memory-constrained Algorithms for Shortest Path Problem. In 23rd Annual Canadian Conference on Computational Geometry (CCCG 2011) (pp. 315-319). Toronto, Canada: CCCG.CA. Retrieved from http://www.cccg.ca/proceedings/2011/papers/paper15.pdf.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0024-491D-1 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0024-491E-0

Genre: Conference Paper

Files

show Files

Locators

show

Creators

show

hide

Creators:
Asano, Tetsuo¹, Author
Doerr, Benjamin², Author

Affiliations:
1External Organizations, ou_persistent22
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

Details

show

hide

Language(s): eng - English

Dates: Published Online: 2011Date issued: 2011

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: -

Identifiers: BibTex Citekey: DoerrA11CCCG
URI: http://www.cccg.ca/proceedings/2011/papers/paper15.pdf

Degree: -

Event

show

hide

Title: CCCG 2011

Place of Event: Toronto, ON

Start-/End Date: 2011-08-10 - 2011-08-10

Legal Case

show

Project information

show

Source 1

show

hide

Title: 23rd Annual Canadian Conference on Computational Geometry (CCCG 2011)

Source Genre: Proceedings

Creator(s):

Affiliations:

Publ. Info: Toronto, Canada : CCCG.CA

Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 315 - 319 Identifier: -