Charting the Algorithmic Complexity of Waypoint Routing

Amiri, Saeed Akhoondian; Foerster, Klaus-Tycho; Jacob, Riko; Schmid, Stefan

doi:10.1145/3211852.3211859

Local TagsRelease HistoryDetailsSummary

Charting the Algorithmic Complexity of Waypoint Routing

Amiri, S. A., Foerster, K.-T., Jacob, R., & Schmid, S. (2018). Charting the Algorithmic Complexity of Waypoint Routing. ACM SIGCOMM Computer Communication Review, 48(1), 42-48. doi:10.1145/3211852.3211859.

Item is Released

show all

Basic

hide

Item Permalink: https://hdl.handle.net/21.11116/0000-0002-7083-B Version Permalink: https://hdl.handle.net/21.11116/0000-0002-7084-A

Genre: Journal Article

Files

show Files

Locators

show

Creators

hide

Creators:
Amiri, Saeed Akhoondian¹, Author
Foerster, Klaus-Tycho², Author
Jacob, Riko², Author
Schmid, Stefan², Author

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

Content

show

Details

hide

Language(s): eng - English

Dates: Published Online: 2018

Publication Status: Published online

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: -

Identifiers: DOI: 10.1145/3211852.3211859
BibTex Citekey: Amiri_CCR2018

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

hide

Title: ACM SIGCOMM Computer Communication Review

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: New York, NY : ACM

Pages: - Volume / Issue: 48 (1) Sequence Number: - Start / End Page: 42 - 48 Identifier: ISSN: 0146-4833