English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
  To Augment or Not to Augment: Solving Unsplittable Flow on a Path by Creating Slack

Grandoni, F., Mömke, T., Wiese, A., & Zhou, H. (2017). To Augment or Not to Augment: Solving Unsplittable Flow on a Path by Creating Slack. In P. N. Klein (Ed.), Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 2411-2422). Philadelphia, PA: SIAM. doi:10.1137/1.9781611974782.159.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-002C-4EB5-B Version Permalink: https://hdl.handle.net/11858/00-001M-0000-002C-4EB6-9
Genre: Conference Paper
Latex : To Augment or Not to Augment: {S}olving Unsplittable Flow on a Path by Creating Slack

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Grandoni, Fabrizio1, Author
Mömke, Tobias1, Author
Wiese, Andreas1, Author           
Zhou, Hang2, 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: 20172017
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: DOI: 10.1137/1.9781611974782.159
BibTex Citekey: doi:10.1137/1.9781611974782.159
 Degree: -

Event

show
hide
Title: Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms
Place of Event: Barcelona, Spain
Start-/End Date: 2017-01-16 - 2017-01-19

Legal Case

show

Project information

show

Source 1

show
hide
Title: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms
  Abbreviation : SODA 2017
Source Genre: Proceedings
 Creator(s):
Klein, Philip N.1, Editor
Affiliations:
1 External Organizations, ou_persistent22            
Publ. Info: Philadelphia, PA : SIAM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 2411 - 2422 Identifier: ISBN: 978-1-61197-478-2