Author of the publication

On the Hardness of Network Design for Bottleneck Routing Games.

, , , and . SAGT, volume 7615 of Lecture Notes in Computer Science, page 156-167. Springer, (2012)

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

Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies., , , and . J. Discrete Algorithms, 4 (3): 433-454 (2006)Special issue on algorithmic game theory (SAGT 2019)., and . Theory Comput. Syst., 66 (3): 517-518 (2022)Efficient Lineage for SUM Aggregate Queries., , and . CoRR, (2013)Virtual European School - VES., , , , , and . ICMCS, Vol. 2, page 1055-1057. IEEE Computer Society, (1999)0-7695-0253-9.Memoryless Facility Location in One Pass.. STACS, volume 3884 of Lecture Notes in Computer Science, page 608-620. Springer, (2006)Linear Label Ranking with Bounded Noise., , , and . NeurIPS, (2022)Perfect Sampling from Pairwise Comparisons., , and . NeurIPS, (2022)Frequency assignment in mobile and radio networks., , , and . Networks in Distributed Computing, volume 45 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 73-90. DIMACS/AMS, (1997)Aggregating Incomplete and Noisy Rankings., , and . AISTATS, volume 130 of Proceedings of Machine Learning Research, page 2278-2286. PMLR, (2021)Efficient Time-Series Clustering through Sparse Gaussian Modeling., , , and . Algorithms, 17 (2): 61 (2024)