André Berger

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 14

Top Topics

Precedence Constraints

Single Facility

Travelling Salesman

Top Venues

Oper. Res. Lett.

J. Optim. Theory Appl.

Comput. Optim. Appl.

Publications

André Berger, Arman Rouhani, Marc Schröder
An improved bound for the price of anarchy for related machine scheduling. CoRR (2024)
André Berger, László Kozma, Matthias Mnich, Roland Vincze
Time- and Space-optimal Algorithm for the Many-visits TSP. ACM Trans. Algorithms 16 (3) (2020)
André Berger, László Kozma, Matthias Mnich, Roland Vincze
A time- and space-optimal algorithm for the many-visits TSP. SODA (2019)
Kristóf Bérczi, André Berger, Matthias Mnich, Roland Vincze
Degree-Bounded Generalized Polymatroids and Approximating the Metric Many-Visits TSP. CoRR (2019)
André Berger, László Kozma, Matthias Mnich, Roland Vincze
Time- and space-optimal algorithms for the many-visits TSP. CoRR (2018)
Peter Danielis, György Dán, James Gross, André Berger
Dynamic Flow Migration for Delay Constrained Traffic in Software-Defined Networks. GLOBECOM (2017)
André Berger, Alexander Grigoriev, Artem A. Panin, Andrej Winokurow
Location, pricing and the problem of Apollonius. Optim. Lett. 11 (8) (2017)
André Berger, Rudolf Müller, Seyed Hossein Naeemi
Characterizing implementable allocation rules in multi-dimensional environments. Soc. Choice Welf. 48 (2) (2017)
André Berger, Alexander Grigoriev, Andrej Winokurow
An efficient algorithm for the single facility location problem with polyhedral norms and disk-shaped demand regions. Comput. Optim. Appl. 68 (3) (2017)
André Berger, Alexander Grigoriev, Artem A. Panin, Andrej Winokurow
Location, Pricing and the Problem of Apollonius. DOOR (2016)
André Berger, Alexander Grigoriev, Andrej Winokurow
A PTAS for the Cluster Editing Problem on Planar Graphs. WAOA (2016)
André Berger, James Gross, Tobias Harks, Simon Tenbusch
Constrained Resource Assignments: Fast Algorithms and Applications in Wireless Networks. Manag. Sci. 62 (7) (2016)
André Berger, Heiko Röglin, Ruben van der Zwaan
Internet routing between autonomous systems: Fast algorithms for path trading. Discret. Appl. Math. 185 (2015)
André Berger, Alexander Grigoriev, Ralf Peeters, Natalya Usotskaya
On Time-Optimal Trajectories in Non-Uniform Mediums. J. Optim. Theory Appl. 165 (2) (2015)
André Berger, Alexander Grigoriev, Pinar Heggernes, Ruben van der Zwaan
Scheduling unit-length jobs with precedence constraints of small height. Oper. Res. Lett. 42 (2) (2014)
André Berger, Alexander Grigoriev, Ruben van der Zwaan
-way vertex cut. Networks 63 (2) (2014)
André Berger, Ojas Parekh
Erratum to: Linear Time Algorithms for Generalized Edge Dominating Set Problems. Algorithmica 62 (1-2) (2012)
André Berger, Alexander Grigoriev, Joyce van Loon
Price strategy implementation. Comput. Oper. Res. 38 (2) (2011)
Ruben van der Zwaan, André Berger, Alexander Grigoriev
How to Cut a Graph into Many Pieces. TAMC (2011)
André Berger, Ralf Hoffmann, Ulf Lorenz, Sebastian Stiller
Online railway delay management: Hardness, simulation and computation. Simul. 87 (7) (2011)
André Berger, Vincenzo Bonifaci, Fabrizio Grandoni, Guido Schäfer
Budgeted matching and budgeted matroid intersection via the gasoline puzzle. Math. Program. 128 (1-2) (2011)
André Berger, Heiko Röglin, Ruben van der Zwaan
Path Trading: Fast Algorithms, Smoothed Analysis, and Hardness Results. SEA (2011)
André Berger, James Gross, Tobias Harks
The k-Constrained Bipartite Matching Problem: Approximation Algorithms and Applications to Wireless Networks. INFOCOM (2010)
André Berger, Rudolf Müller, Seyed Hossein Naeemi
Characterizing Incentive Compatibility for Convex Valuations. SAGT (2009)
André Berger, Ojas Parekh
Linear Time Algorithms for Generalized Edge Dominating Set Problems. Algorithmica 50 (2) (2008)
André Berger, Ralf Hoffmann, Ulf Lorenz, Sebastian Stiller
TOPSU - RDM a simulation platform for online railway delay management. SimuTools (2008)
André Berger, Vincenzo Bonifaci, Fabrizio Grandoni, Guido Schäfer
Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle. IPCO (2008)
André Berger, Takuro Fukunaga, Hiroshi Nagamochi, Ojas Parekh
Approximability of the capacitated b-edge dominating set problem. Theor. Comput. Sci. 385 (1-3) (2007)
André Berger, Michelangelo Grigni
Minimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs. ICALP (2007)
André Berger, Nader Razouk, Greg Angelides
Distance- and curvature-constrained shortest paths and an application in mission planning. ACM Southeast Regional Conference (2006)
André Berger, Ojas Parekh
Linear Time Algorithms for Generalized Edge Dominating Set Problems. WADS (2005)
André Berger, Artur Czumaj, Michelangelo Grigni, Hairong Zhao
Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs. ESA (2005)