( en | de | ru )

 

Disambiguation of "Berger, André"

Author of the publication

copydeleteadd this publication to your clipboard
Price strategy implementation.

, , and . Comput. Oper. Res., 38 (2): 420-426 (2011)

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

Karl Wilhelm Andrée

Emil Andrée

Gustav André

 

Other publications of authors with the same name

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)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)An improved bound for the price of anarchy for related machine scheduling., , and . CoRR, (2024)Location, pricing and the problem of Apollonius., , , and . Optim. Lett., 11 (8): 1797-1805 (2017)Degree-Bounded Generalized Polymatroids and Approximating the Metric Many-Visits TSP., , , and . CoRR, (2019)Linear Time Algorithms for Generalized Edge Dominating Set Problems., and . Algorithmica, 50 (2): 244-254 (2008)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)How to Cut a Graph into Many Pieces., , and . TAMC, volume 6648 of Lecture Notes in Computer Science, page 184-194. Springer, (2011)