André Berger

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