Friedrich Eisenbrand Jochen Koenemann (Eds.) Integer Programming 8 2 3 and Combinatorial 0 1 S C Optimization N L 19th International Conference, IPCO 2017 Waterloo, ON, Canada, June 26–28, 2017 Proceedings 123 Lecture Notes in Computer Science 10328 Commenced Publication in 1973 Founding and Former Series Editors: Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen Editorial Board David Hutchison Lancaster University, Lancaster, UK Takeo Kanade Carnegie Mellon University, Pittsburgh, PA, USA Josef Kittler University of Surrey, Guildford, UK Jon M. Kleinberg Cornell University, Ithaca, NY, USA Friedemann Mattern ETH Zurich, Zurich, Switzerland John C. Mitchell Stanford University, Stanford, CA, USA Moni Naor Weizmann Institute of Science, Rehovot, Israel C. Pandu Rangan Indian Institute of Technology, Madras, India Bernhard Steffen TU Dortmund University, Dortmund, Germany Demetri Terzopoulos University of California, Los Angeles, CA, USA Doug Tygar University of California, Berkeley, CA, USA Gerhard Weikum Max Planck Institute for Informatics, Saarbrücken, Germany More information about this series at http://www.springer.com/series/7407 Friedrich Eisenbrand Jochen Koenemann (Eds.) (cid:129) Integer Programming and Combinatorial Optimization 19th International Conference, IPCO 2017 – Waterloo, ON, Canada, June 26 28, 2017 Proceedings 123 Editors Friedrich Eisenbrand JochenKoenemann EcolePolytechnique Federale University of Waterloo deLausanne - EPFL Waterloo, ON Lausanne Canada Switzerland ISSN 0302-9743 ISSN 1611-3349 (electronic) Lecture Notesin Computer Science ISBN 978-3-319-59249-7 ISBN978-3-319-59250-3 (eBook) DOI 10.1007/978-3-319-59250-3 LibraryofCongressControlNumber:2017941547 LNCSSublibrary:SL1–TheoreticalComputerScienceandGeneralIssues ©SpringerInternationalPublishingAG2017 Thisworkissubjecttocopyright.AllrightsarereservedbythePublisher,whetherthewholeorpartofthe 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 storageandretrieval,electronicadaptation,computersoftware,orbysimilarordissimilarmethodologynow knownorhereafterdeveloped. Theuseofgeneraldescriptivenames,registerednames,trademarks,servicemarks,etc.inthispublication doesnotimply,evenintheabsenceofaspecificstatement,thatsuchnamesareexemptfromtherelevant protectivelawsandregulationsandthereforefreeforgeneraluse. Thepublisher,theauthorsandtheeditorsaresafetoassumethattheadviceandinformationinthisbookare believedtobetrueandaccurateatthedateofpublication.Neitherthepublishernortheauthorsortheeditors give a warranty, express or implied, with respect to the material contained herein or for any errors or omissionsthatmayhavebeenmade.Thepublisherremainsneutralwithregardtojurisdictionalclaimsin publishedmapsandinstitutionalaffiliations. Printedonacid-freepaper ThisSpringerimprintispublishedbySpringerNature TheregisteredcompanyisSpringerInternationalPublishingAG Theregisteredcompanyaddressis:Gewerbestrasse11,6330Cham,Switzerland Preface This volume contains the 36 extended abstracts presented at IPCO 2017, the 19th Conference on Integer Programming and Combinatorial Optimization, held during June 26–28, 2017, in Waterloo, Canada. IPCO is under the auspices of the Mathe- maticalOptimizationSociety.ThefirstIPCOconferencetookplaceattheUniversityof WaterlooinMay1990and itreturned toWaterloofor thefirsttime thisyear.IPCOis held every year, except for those in which the International Symposium on Mathe- matical Programming is held. TheconferencehadaProgramCommitteeconsistingof14members.Inresponseto thecallforpapers,wereceived125submissions,ofwhichthreewerewithdrawnprior to the decision progress. The Program Committee met in Leysin, Switzerland, in January 2017. Each submission was reviewed by at least three Program Committee members.Thereweremanyhigh-qualitysubmissions,ofwhichthecommitteeselected 36toappearintheconferenceproceedings.Weexpectthefullversionsoftheextended abstracts appearing here to be submitted for publication in refereed journals. Thisyear,IPCOwasprecededbyaSummerSchoolduringJune24–25,2017,with lectures by Sanjeeb Dash, Anupam Gupta, and Aleksander Madry. We would like to thank: – The authors who submitted their research to IPCO – The members of the Program Committee, who spent much time and energy reviewing the submissions – The expert additional reviewers whose opinion was crucial in the paper selection – The members of the local Organizing Committee, who made this conference possible April 2017 Friedrich Eisenbrand Jochen Koenemann Organization Program Committee Nikhil Bansal Eindhoven University of Technology, The Netherlands Gérard Cornuéjols Carnegie Mellon University, USA Daniel Dadush Centrum Wiskunde and Informatica, The Netherlands Santanu S. Dey Georgia Institute of Technology, USA Friedrich Eisenbrand EPFL, Switzerland Samuel Fiorini Université Libre de Bruxelles, Belgium Anupam Gupta Carnegie Mellon University, USA Satoru Iwata University of Tokyo, Japan Jochen Koenemann University of Waterloo, Canada Kurt Mehlhorn MPI Informatik, Germany Seffi Naor Technion, Haifa, Israel Britta Peis RWTH Aachen, Germany Laura Sanità University of Waterloo, Canada Laurence Wolsey CORE, Université catholique de Louvain, Belgium Rico Zenklusen ETH Zurich, Switzerland Additional Reviewers Abdi, Ahmad Cevallos, Alfonso Fleiner, Tamas Aboulker, Pierre Chakrabarty, Deeparnab Fukasawa, Ricardo Adjiashvili, David Chalermsook, Parinya Fukunaga, Takuro Ahmed, Shabbir Cheriyan, Joe Gairing, Martin Althaus, Ernst Chestnut, Stephen Garg, Naveen Antoniadis, Antonios Chubanov, Sergei Gaubert, Stephane Azar, Yossi Conforti, Michele Goldner, Kira Bar-Noy, Amotz Cornuejols, Gerard Gottschalk, Corinna Barvinkok, Alexander Cseh, Ágnes Grandoni, Fabrizio Basu, Amitabh Cygan, Marek Gribling, Sander Bei, Xiaohui Dash, Sanjeeb Groß, Martin Benchetrit, Yohann Di Summa, Marco Gunluk, Oktay Blekherman, Greg Ene, Alina Gupta, Swati Bonifaci, Vincenzo Even, Guy Gupte, Akshay Bonomo, Flavia Faenza, Yuri Guzman, Cristobal Boros, Endre Fairstein, Yaron Hansen,ThomasDueholm Buchbinder, Niv Farczadi, Linda Harks, Tobias Byrka, Jaroslaw Feldman, Moran Hartvigsen, David Bérczi, Kristóf Filmus, Yuval Hassin, Refael VIII Organization Hildebrand, Robert Mccormick, Tom Skopalik, Alexander Hirai, Hiroshi Megow, Nicole Skutella, Martin Hoefer, Martin Mehta, Aranyak Soma, Tasuku Hosten, Serkan Mestre, Julian Stephens-Davidowitz, Huang, Chien-Chung Miyazaki, Shuichi Noah Huchette, Joey Mnich, Matthias Straszak, Damian Huynh, Tony Mohar, Bojan Strehler, Martin Im, Sungjin Molinaro, Marco Svensson, Ola Jansen, Klaus Murota, Kazuo Swamy, Chaitanya Jerrum, Mark Mömke, Tobias Takazawa, Kenjiro Joret, Gwenaël Nagano, Kiyohito Talmon, Ohad Kaibel, Volker Nagarajan, Viswanath Tanigawa, Shin-Ichi Kakimura, Naonori Newman, Alantha Toriello, Alejandro Kalaitzis, Christos Nikolov, Aleksandar Trick, Michael Kamiyama, Naoyuki Onak, Krzysztof Tönnis, Andreas Kaplan, Haim Oriolo, Gianpaolo Uetz, Marc Kapralov, Michael Panigrahi, Debmalya Umboh, Seeun William Kesselheim, Thomas Pashkovich, Kanstantsin van Stee, Rob Kimura, Kei Pfetsch, Marc Van Vyve, Mathieu Klimm, Max Puleo, Gregory van Zuylen, Anke Koeppe, Matthias Rabani, Yuval Vegh, Laszlo Krishnaswamy, Ralphs, Ted Ventura, Paolo Ravishankar Ravi, R. Verschae, José Kuhn, Daniel Richard, Jean Philippe Vielma, Juan Pablo Kumar, Amit Roytman, Alan Vishnoi, Nisheeth Kutiel, Gilad Röglin, Heiko von Heymann, Frederik Lau, Lap Chi Salvagnin, Domenico Wajc, David Lee, Yin Tat Schaudt, Oliver Weismantel, Robert Letchford, Adam Schwartz, Roy Weltge, Stefan Li, Shi Schweitzer, Pascal Wierz, Andreas Linderoth, Jeff Sebo, Andras Wiese, Andreas Lokshtanov, Daniel Seddighin, Saeed Wollan, Paul Marchetti-Spaccamela, Shigeno, Maiko Woods, Kevin Alberto Singh, Mohit Xie, Weijun Matuschke, Jannik Singla, Sahil Yu, Josephine McCormick, Tom Sinnl, Markus Zhou, Hang Contents The Two-Point Fano and Ideal Binary Clutters. . . . . . . . . . . . . . . . . . . . . . 1 Ahmad Abdi and Bertrand Guenin On Scheduling Coflows. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 Saba Ahmadi, Samir Khuller, Manish Purohit, and Sheng Yang Integrality Gaps of Integer Knapsack Problems. . . . . . . . . . . . . . . . . . . . . . 25 Iskander Aliev, Martin Henk, and Timm Oertel An Improved Integrality Gap for the Călinescu-Karloff-Rabani Relaxation for Multiway Cut . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 39 Haris Angelidakis, Yury Makarychev, and Pasin Manurangsi Approximation of Corner Polyhedra with Families of Intersection Cuts . . . . . 51 Gennadiy Averkov, Amitabh Basu, and Joseph Paat The Structure of the Infinite Models in Integer Programming . . . . . . . . . . . . 63 Amitabh Basu, Michele Conforti, Marco Di Summa, and Joseph Paat Mixed-Integer Linear Representability, Disjunctions, and Variable Elimination . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 75 Amitabh Basu, Kipp Martin, Christopher Thomas Ryan, and Guanyi Wang Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Time. . . . . . . . . . . . . . . . . . . . . . . . . 86 Sayan Bhattacharya, Deeparnab Chakrabarty, and Monika Henzinger Cutting Planes from Wide Split Disjunctions . . . . . . . . . . . . . . . . . . . . . . . 99 Pierre Bonami, Andrea Lodi, Andrea Tramontani, and Sven Wiese The Saleman’s Improved Tours for Fundamental Classes. . . . . . . . . . . . . . . 111 Sylvia Boyd and András Sebő The Heterogeneous Capacitated k-Center Problem. . . . . . . . . . . . . . . . . . . . 123 Deeparnab Chakrabarty, Ravishankar Krishnaswamy, and Amit Kumar Local Guarantees in Graph Cuts and Clustering . . . . . . . . . . . . . . . . . . . . . 136 Moses Charikar, Neha Gupta, and Roy Schwartz Verifying Integer Programming Results . . . . . . . . . . . . . . . . . . . . . . . . . . . 148 Kevin K.H. Cheung, Ambros Gleixner, and Daniel E. Steffy X Contents Long Term Behavior of Dynamic Equilibria in Fluid Queuing Networks . . . . 161 Roberto Cominetti, José Correa, and Neil Olver A 4/5 - Approximation Algorithm for the Maximum Traveling Salesman Problem. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 173 Szymon Dudycz, Jan Marcinkowski, Katarzyna Paluch, and Bartosz Rybicki Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 186 Daniel Freund, Shane G. Henderson, and David B. Shmoys Compact, Provably-Good LPs for Orienteering and Regret-Bounded Vehicle Routing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 199 Zachary Friggstad and Chaitanya Swamy Discrete Newton’s Algorithm for Parametric Submodular Function Minimization. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 212 Michel X. Goemans, Swati Gupta, and Patrick Jaillet Stochastic Online Scheduling on Unrelated Machines . . . . . . . . . . . . . . . . . 228 Varun Gupta, Benjamin Moseley, Marc Uetz, and Qiaomin Xie Online Matroid Intersection: Beating Half for Random Arrival . . . . . . . . . . . 241 Guru Prashanth Guruganesh and Sahil Singla Number Balancing is as Hard as Minkowski’s Theorem and Shortest Vector. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 254 Rebecca Hoberg, Harishchandra Ramadas, Thomas Rothvoss, and Xin Yang An Improved Deterministic Rescaling for Linear Programming Algorithms. . . . 267 Rebecca Hoberg and Thomas Rothvoss Min-Max Theorems for Packing and Covering Odd (u, v)-trails . . . . . . . . . . 279 Sharat Ibrahimpur and Chaitanya Swamy Breaking 1(cid:1)1=e Barrier for Non-preemptive Throughput Maximization. . . . 292 Sungjin Im, Shi Li, and Benjamin Moseley A Quasi-Polynomial Approximation for the Restricted Assignment Problem. . . 305 Klaus Jansen and Lars Rohwedder Adaptive Submodular Ranking. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 317 Prabhanjan Kambadur, Viswanath Nagarajan, and Fatemeh Navidi On the Notions of Facets, Weak Facets, and Extreme Functions of the Gomory–Johnson Infinite Group Problem. . . . . . . . . . . . . . . . . . . . . 330 Matthias Köppe and Yuan Zhou