Approximation Algorithms for Car-Sharing Problems

We consider several variants of a car-sharing problem. Given are a number of requests each consisting of a pick-up location and a drop-off location, a number of cars, and nonnegative, symmetric travel times that satisfy the triangle inequality. Each reque

  • PDF / 16,645,429 Bytes
  • 691 Pages / 439.37 x 666.142 pts Page_size
  • 8 Downloads / 224 Views

DOWNLOAD

REPORT


Donghyun Kim R. N. Uma Zhipeng Cai Dong Hoon Lee (Eds.)

Computing and Combinatorics 26th International Conference, COCOON 2020 Atlanta, GA, USA, August 29–31, 2020 Proceedings

Lecture Notes in Computer Science Founding Editors Gerhard Goos Karlsruhe Institute of Technology, Karlsruhe, Germany Juris Hartmanis Cornell University, Ithaca, NY, USA

Editorial Board Members Elisa Bertino Purdue University, West Lafayette, IN, USA Wen Gao Peking University, Beijing, China Bernhard Steffen TU Dortmund University, Dortmund, Germany Gerhard Woeginger RWTH Aachen, Aachen, Germany Moti Yung Columbia University, New York, NY, USA

12273

More information about this series at http://www.springer.com/series/7407

Donghyun Kim R. N. Uma Zhipeng Cai Dong Hoon Lee (Eds.) •





Computing and Combinatorics 26th International Conference, COCOON 2020 Atlanta, GA, USA, August 29–31, 2020 Proceedings

123

Editors Donghyun Kim Georgia State University Atlanta, USA Zhipeng Cai Computer Science Georgia State University Atlanta, GA, USA

R. N. Uma Department of Mathematics and Physics North Carolina Central University Durham, NC, USA Dong Hoon Lee Korea University Seoul, South Korea

ISSN 0302-9743 ISSN 1611-3349 (electronic) Lecture Notes in Computer Science ISBN 978-3-030-58149-7 ISBN 978-3-030-58150-3 (eBook) https://doi.org/10.1007/978-3-030-58150-3 LNCS Sublibrary: SL1 – Theoretical Computer Science and General Issues © Springer Nature Switzerland AG 2020 This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. The publisher, the authors and the editors are safe to assume that the advice and information in this book are believed to be true and accurate at the date of publication. Neither the publisher nor the authors or the editors give a warranty, expressed or implied, with respect to the material contained herein or for any errors or omissions that may have been made. The publisher remains neutral with regard to jurisdictional claims in published maps and institutional affiliations. This Springer imprint is published by the registered company Springer Nature Switzerland AG The registered company address is: Gewerbestrasse 11, 6330 Cham, Switzerland

Preface

The 26th International Computing and Combinatorics Conference (COCOON 2020) was held during August 29–31, 2020. This year, COCOON 2020 was organized as a fully online conference. COCOON 2020 provided

Data Loading...