Author of the publication

The Price of Optimum: Complexity and Approximation for a Matching Game.

, , and . Algorithmica, 77 (3): 836-866 (2017)

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.

 

Other publications of authors with the same name

Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality., , and . SOFSEM, volume 4910 of Lecture Notes in Computer Science, page 280-291. Springer, (2008)Parameterized Power Vertex Cover., , , and . WG, volume 9941 of Lecture Notes in Computer Science, page 97-108. (2016)The Price of Optimum in a Matching Game., , and . SAGT, volume 6982 of Lecture Notes in Computer Science, page 81-92. Springer, (2011)Two-stage stochastic matching and spanning tree problems: Polynomial instances and approximation., , , and . Eur. J. Oper. Res., 205 (1): 19-30 (2010)LP-based algorithms for multistage minimization problems., , and . CoRR, (2019)Improved worst-case complexity for the MIN 3-SET COVERING problem., , and . Oper. Res. Lett., 35 (2): 205-210 (2007)Algorithmic Recognition of 2-Euclidean Preferences., , and . ECAI, volume 372 of Frontiers in Artificial Intelligence and Applications, page 637-644. IOS Press, (2023)Online TSP with Known Locations., , , and . WADS, volume 14079 of Lecture Notes in Computer Science, page 65-78. Springer, (2023)Online Multistage Subset Maximization Problems., , , and . Algorithmica, 83 (8): 2374-2399 (2021)A simple rounding scheme for multistage optimization., , , , and . Theor. Comput. Sci., (2022)