( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Fast Approximation in Subspaces by Doubling Metric Decomposition.

, , , , и . ESA (1), том 6346 из Lecture Notes in Computer Science, стр. 72-83. Springer, (2010)

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.

Heinz Mucha

Joachim Mucha

Ursula Mucha

Armin Mucha

Willfried Mucha

 

Другие публикации лиц с тем же именем

No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem., и . ICALP (1), том 7965 из Lecture Notes in Computer Science, стр. 769-779. Springer, (2013)Lyndon Words and Short Superstrings.. SODA, стр. 958-972. SIAM, (2013)Maximum Matchings in Planar Graphs via Gaussian Elimination., и . ESA, том 3221 из Lecture Notes in Computer Science, стр. 532-543. Springer, (2004)Matroid-Based TSP Rounding for Half-Integral Solutions., , , , , и . IPCO, том 13265 из Lecture Notes in Computer Science, стр. 305-318. Springer, (2022)Fast Approximation in Subspaces by Doubling Metric Decomposition., , , , и . ESA (1), том 6346 из Lecture Notes in Computer Science, стр. 72-83. Springer, (2010)Shortest Superstring.. CPM, том 78 из LIPIcs, стр. 3:1-3:1. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)An Improved Algorithm For Online Reranking., и . CoRR, (2022)On Problems Equivalent to (min, +)-Convolution., , , и . ACM Trans. Algorithms, 15 (1): 14:1-14:25 (2019)A Subquadratic Approximation Scheme for Partition., , и . SODA, стр. 70-88. SIAM, (2019)An Improved Algorithm for Online Min-Sum Set Cover., и . AAAI, стр. 6815-6822. AAAI Press, (2023)