André Berger

According to our database1, André Berger authored at least 29 papers between 2005 and 2019.

Collaborative distances:



In proceedings 
PhD thesis 




A time- and space-optimal algorithm for the many-visits TSP.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Time- and space-optimal algorithms for the many-visits TSP.
CoRR, 2018

Characterizing implementable allocation rules in multi-dimensional environments.
Social Choice and Welfare, 2017

Location, pricing and the problem of Apollonius.
Optimization Letters, 2017

An efficient algorithm for the single facility location problem with polyhedral norms and disk-shaped demand regions.
Comp. Opt. and Appl., 2017

Dynamic Flow Migration for Delay Constrained Traffic in Software-Defined Networks.
Proceedings of the 2017 IEEE Global Communications Conference, 2017

Constrained Resource Assignments: Fast Algorithms and Applications in Wireless Networks.
Management Science, 2016

A PTAS for the Cluster Editing Problem on Planar Graphs.
Proceedings of the Approximation and Online Algorithms - 14th International Workshop, 2016

Location, Pricing and the Problem of Apollonius.
Proceedings of the Discrete Optimization and Operations Research, 2016

On Time-Optimal Trajectories in Non-Uniform Mediums.
J. Optimization Theory and Applications, 2015

Internet routing between autonomous systems: Fast algorithms for path trading.
Discrete Applied Mathematics, 2015

Scheduling unit-length jobs with precedence constraints of small height.
Oper. Res. Lett., 2014

Complexity and approximability of the k-way vertex cut.
Networks, 2014

Erratum to: Linear Time Algorithms for Generalized Edge Dominating Set Problems.
Algorithmica, 2012

Online railway delay management: Hardness, simulation and computation.
Simulation, 2011

Budgeted matching and budgeted matroid intersection via the gasoline puzzle.
Math. Program., 2011

Price strategy implementation.
Computers & OR, 2011

Path Trading: Fast Algorithms, Smoothed Analysis, and Hardness Results.
Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

How to Cut a Graph into Many Pieces.
Proceedings of the Theory and Applications of Models of Computation, 2011

The k-Constrained Bipartite Matching Problem: Approximation Algorithms and Applications to Wireless Networks.
Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

Characterizing Incentive Compatibility for Convex Valuations.
Proceedings of the Algorithmic Game Theory, Second International Symposium, 2009

Linear Time Algorithms for Generalized Edge Dominating Set Problems.
Algorithmica, 2008

TOPSU - RDM a simulation platform for online railway delay management.
Proceedings of the 1st International Conference on Simulation Tools and Techniques for Communications, 2008

Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle.
Proceedings of the Integer Programming and Combinatorial Optimization, 2008

Approximability of the capacitated b-edge dominating set problem.
Theor. Comput. Sci., 2007

Minimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs.
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

Distance- and curvature-constrained shortest paths and an application in mission planning.
Proceedings of the 44st Annual Southeast Regional Conference, 2006

Linear Time Algorithms for Generalized Edge Dominating Set Problems.
Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005

Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs.
Proceedings of the Algorithms, 2005