Improved Algorithms for Distributed Balanced Clustering
We study a weighted balanced version of the k-center problem, where each center has a fixed capacity, and each element has an arbitrary demand. The objective is to assign demands of the elements to the centers, so as the total demand assigned to each cent
- PDF / 5,598,144 Bytes
- 125 Pages / 439.37 x 666.142 pts Page_size
- 22 Downloads / 234 Views
Luís S. Barbosa Mohammad Ali Abam (Eds.)
Topics in Theoretical Computer Science Third IFIP WG 1.8 International Conference, TTCS 2020 Tehran, Iran, July 1–2, 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
12281
More information about this series at http://www.springer.com/series/7407
Luís S. Barbosa Mohammad Ali Abam (Eds.) •
Topics in Theoretical Computer Science Third IFIP WG 1.8 International Conference, TTCS 2020 Tehran, Iran, July 1–2, 2020 Proceedings
123
Editors Luís S. Barbosa Universidade do Minho Braga, Portugal
Mohammad Ali Abam Sharif University of Technology Tehran, Iran
ISSN 0302-9743 ISSN 1611-3349 (electronic) Lecture Notes in Computer Science ISBN 978-3-030-57851-0 ISBN 978-3-030-57852-7 (eBook) https://doi.org/10.1007/978-3-030-57852-7 LNCS Sublibrary: SL1 – Theoretical Computer Science and General Issues © IFIP International Federation for Information Processing 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
We are honored to bring you this collection of the revised selected papers from the third IFIP WG 1.8 International Conference on Topics in Theoretical Computer Science (TTCS 2020), which was held at the School of Computer Science, Institute for Research in Fundamental Sciences (IPM), Tehran, Iran, July 1–2, 2020. TTCS is a bi-annua
Data Loading...
