A Fully Polynomial Time Approximation Scheme for Packing While Traveling - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Frank Neumann 0001, Sergey Polyakovskiy, Martin Skutella, Leen Stougie, Junhua Wu. A Fully Polynomial Time Approximation Scheme for Packing While Traveling. In Yann Disser, Vassilios S. Verykios, editors, Algorithmic Aspects of Cloud Computing - 4th International Symposium, ALGOCLOUD 2018, Helsinki, Finland, August 20-21, 2018, Revised Selected Papers. Volume 11409 of Lecture Notes in Computer Science, pages 59-72, Springer, 2018. [doi]

This author has not been identified. Look up 'Frank Neumann 0001' in GoogleThis author has not been identified. Look up 'Sergey Polyakovskiy' in GoogleThis author has not been identified. Look up 'Martin Skutella' in GoogleThis author has not been identified. Look up 'Leen Stougie' in GoogleThis author has not been identified. Look up 'Junhua Wu' in Google

runs on WebDSL