A Fully Polynomial Time Approximation Scheme for Packing While Traveling

Neumann, Frank, Polyakovskiy, Sergey, Skutella, Martin, Stougie, Leen and Wu, Junhua 2019, A Fully Polynomial Time Approximation Scheme for Packing While Traveling, in ALGOCLOUD 2018 : Algorithmic Aspects of Cloud Computing., Springer, Cham, Switzerland, pp. 59-72, doi: 10.1007/978-3-030-19759-9_5.

Attached Files
Name Description MIMEType Size Downloads

Title A Fully Polynomial Time Approximation Scheme for Packing While Traveling
Author(s) Neumann, Frank
Polyakovskiy, SergeyORCID iD for Polyakovskiy, Sergey orcid.org/0000-0001-9489-1972
Skutella, Martin
Stougie, Leen
Wu, Junhua
Conference name Algorithmic Aspects of Cloud Computing. Symposium (2018 : Helsinki, Finland)
Conference location Helsinki, Finland
Conference dates 20-21 Aug. 2018
Title of proceedings ALGOCLOUD 2018 : Algorithmic Aspects of Cloud Computing.
Editor(s) Disser, Y.
Verykios, V.
Publication date 2019
Start page 59
End page 72
Total pages 14
Publisher Springer
Place of publication Cham, Switzerland
Keyword(s) cs.DS
90C27
G.2.1; F.2.2
ISBN 978-3-030-19759-9
Language eng
DOI 10.1007/978-3-030-19759-9_5
Indigenous content off
HERDC Research category E1 Full written paper - refereed
Grant ID DP130104395
DP140103400
Persistent URL http://hdl.handle.net/10536/DRO/DU:30106179

Connect to link resolver
 
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.

Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 0 times in TR Web of Science
Scopus Citation Count Cited 5 times in Scopus
Google Scholar Search Google Scholar
Access Statistics: 20 Abstract Views, 2 File Downloads  -  Detailed Statistics
Created: Thu, 09 Aug 2018, 11:08:28 EST

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.