default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID19th IPCO 2017: Waterloo, ON, Canada
- Friedrich Eisenbrand, Jochen Könemann:
Integer Programming and Combinatorial Optimization - 19th International Conference, IPCO 2017, Waterloo, ON, Canada, June 26-28, 2017, Proceedings. Lecture Notes in Computer Science 10328, Springer 2017, ISBN 978-3-319-59249-7 - Ahmad Abdi, Bertrand Guenin:
The Two-Point Fano and Ideal Binary Clutters. 1-12 - Saba Ahmadi, Samir Khuller, Manish Purohit, Sheng Yang:
On Scheduling Coflows - (Extended Abstract). 13-24 - Iskander Aliev, Martin Henk, Timm Oertel
:
Integrality Gaps of Integer Knapsack Problems. 25-38 - Haris Angelidakis, Yury Makarychev, Pasin Manurangsi:
An Improved Integrality Gap for the Călinescu-Karloff-Rabani Relaxation for Multiway Cut. 39-50 - Gennadiy Averkov, Amitabh Basu, Joseph Paat:
Approximation of Corner Polyhedra with Families of Intersection Cuts. 51-62 - Amitabh Basu, Michele Conforti, Marco Di Summa, Joseph Paat:
The Structure of the Infinite Models in Integer Programming. 63-74 - Amitabh Basu, R. Kipp Martin, Christopher Thomas Ryan, Guanyi Wang:
Mixed-Integer Linear Representability, Disjunctions, and Variable Elimination. 75-85 - Sayan Bhattacharya, Deeparnab Chakrabarty, Monika Henzinger:
Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Time. 86-98 - Pierre Bonami, Andrea Lodi, Andrea Tramontani, Sven Wiese:
Cutting Planes from Wide Split Disjunctions. 99-110 - Sylvia C. Boyd, András Sebö:
The Saleman's Improved Tours for Fundamental Classes. 111-122 - Deeparnab Chakrabarty, Ravishankar Krishnaswamy, Amit Kumar:
The Heterogeneous Capacitated k-Center Problem. 123-135 - Moses Charikar, Neha Gupta, Roy Schwartz:
Local Guarantees in Graph Cuts and Clustering. 136-147 - Kevin K. H. Cheung, Ambros M. Gleixner, Daniel E. Steffy:
Verifying Integer Programming Results. 148-160 - Roberto Cominetti, José Correa, Neil Olver:
Long Term Behavior of Dynamic Equilibria in Fluid Queuing Networks. 161-172 - Szymon Dudycz, Jan Marcinkowski, Katarzyna E. Paluch, Bartosz Rybicki:
A 4/5 - Approximation Algorithm for the Maximum Traveling Salesman Problem. 173-185 - Daniel Freund, Shane G. Henderson, David B. Shmoys:
Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems. 186-198 - Zachary Friggstad, Chaitanya Swamy:
Compact, Provably-Good LPs for Orienteering and Regret-Bounded Vehicle Routing. 199-211 - Michel X. Goemans, Swati Gupta, Patrick Jaillet:
Discrete Newton's Algorithm for Parametric Submodular Function Minimization. 212-227 - Varun Gupta, Benjamin Moseley, Marc Uetz, Qiaomin Xie:
Stochastic Online Scheduling on Unrelated Machines. 228-240 - Guru Prashanth Guruganesh, Sahil Singla:
Online Matroid Intersection: Beating Half for Random Arrival. 241-253 - Rebecca Hoberg, Harishchandra Ramadas, Thomas Rothvoss, Xin Yang:
Number Balancing is as Hard as Minkowski's Theorem and Shortest Vector. 254-266 - Rebecca Hoberg, Thomas Rothvoss:
An Improved Deterministic Rescaling for Linear Programming Algorithms. 267-278 - Sharat Ibrahimpur, Chaitanya Swamy:
Min-Max Theorems for Packing and Covering Odd (u, v)-trails. 279-291 - Sungjin Im, Shi Li, Benjamin Moseley:
Breaking 1 - 1/e Barrier for Non-preemptive Throughput Maximization. 292-304 - Klaus Jansen, Lars Rohwedder:
A Quasi-Polynomial Approximation for the Restricted Assignment Problem. 305-316 - Prabhanjan Kambadur, Viswanath Nagarajan, Fatemeh Navidi:
Adaptive Submodular Ranking. 317-329 - Matthias Köppe, Yuan Zhou:
On the Notions of Facets, Weak Facets, and Extreme Functions of the Gomory-Johnson Infinite Group Problem. 330-342 - Janardhan Kulkarni, Euiwoong Lee, Mohit Singh:
Minimum Birkhoff-von Neumann Decomposition. 343-354 - Euiwoong Lee, Sahil Singla:
Maximum Matching in the Online Batch-Arrival Model. 355-367 - Stefano Leonardi, Gianpiero Monaco, Piotr Sankowski, Qiang Zhang:
Budget Feasible Mechanisms on Matroids. 368-379 - Avi Levy, Harishchandra Ramadas, Thomas Rothvoss:
Deterministic Discrepancy Minimization via the Multiplicative Weight Update Method. 380-391 - Miles Lubin, Ilias Zadik, Juan Pablo Vielma:
Mixed-Integer Convex Representability. 392-404 - Monaldo Mastrolilli:
High Degree Sum of Squares Proofs, Bienstock-Zuckerberg Hierarchy and CG Cuts. 405-416 - Danny Nguyen, Igor Pak:
Enumeration of Integer Points in Projections of Unbounded Polyhedra. 417-429 - Kenjiro Takazawa:
Excluded t-Factors in Bipartite Graphs: A Unified Framework for Nonbipartite Matchings and Restricted 2-Matchings. 430-441 - Tobias Harks, Veerle Timmermans:
Equilibrium Computation in Atomic Splittable Singleton Congestion Games. 442-454
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-01-05 00:26 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
