( en | de | ru )

 

Disambiguation of "Berger, André"

Author of the publication

copydeleteadd this publication to your clipboard
Time- and space-optimal algorithms for the many-visits TSP.

, , , and . CoRR, (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

André Berger

André Berger

Ernst-Christian André

Helmut André

Achim André

 

Other publications of authors with the same name

A PTAS for the Cluster Editing Problem on Planar Graphs., , and . WAOA, volume 10138 of Lecture Notes in Computer Science, page 27-39. Springer, (2016)An efficient algorithm for the single facility location problem with polyhedral norms and disk-shaped demand regions., , and . Comput. Optim. Appl., 68 (3): 661-669 (2017)Characterizing implementable allocation rules in multi-dimensional environments., , and . Social Choice and Welfare, 48 (2): 367-383 (2017)The k-Constrained Bipartite Matching Problem: Approximation Algorithms and Applications to Wireless Networks., , and . INFOCOM, page 2043-2051. IEEE, (2010)An improved bound for the price of anarchy for related machine scheduling., , and . CoRR, (2024)Linear Time Algorithms for Generalized Edge Dominating Set Problems., and . Algorithmica, 50 (2): 244-254 (2008)Degree-Bounded Generalized Polymatroids and Approximating the Metric Many-Visits TSP., , , and . CoRR, (2019)Location, pricing and the problem of Apollonius., , , and . Optim. Lett., 11 (8): 1797-1805 (2017)Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs., , , and . ESA, volume 3669 of Lecture Notes in Computer Science, page 472-483. Springer, (2005)Constrained Resource Assignments: Fast Algorithms and Applications in Wireless Networks., , , and . Manag. Sci., 62 (7): 2070-2089 (2016)