( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A 3-Approximation Algorithm for Maximum Independent Set of Rectangles.

, , , , , и . SODA, стр. 894-905. SIAM, (2022)

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.

Stefanie Hedwig Mömke

Torsten Mömken

Henrik Mömken

Tobias Tobias

Tobias Balkenhol

Adaptive Digitalfilter für die aktive Schalldämmung in Röhrensystemen. Uni Paderborn, (2009)
 

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

Robust Reoptimization of Steiner Trees., и . Algorithmica, 82 (7): 1966-1988 (2020)A 4-Approximation Algorithm for Maximum Independent Set of Rectangles., , , , , и . CoRR, (2021)Improved integrality gap upper bounds for traveling salesperson problems with distances one and two., и . Eur. J. Oper. Res., 266 (2): 436-457 (2018)Robust Reoptimization of Steiner Trees., и . FSTTCS, том 45 из LIPIcs, стр. 10-24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)A 2-approximation for the bounded treewidth sparsest cut problem in sfFPT Time., , и . Math. Program., 206 (1): 479-495 (июля 2024)Efficient Algorithms for the Spoonerism Problem., , , , и . FUN, том 4475 из Lecture Notes in Computer Science, стр. 78-92. Springer, (2007)Structural Properties of Hard Metric TSP Inputs - (Extended Abstract).. SOFSEM, том 6543 из Lecture Notes in Computer Science, стр. 394-405. Springer, (2011)Improved Approximations for Hard Optimization Problems via Problem Instance Classification., , и . Rainbow of Computer Science, том 6570 из Lecture Notes in Computer Science, стр. 3-19. Springer, (2011)Randomized Online Algorithms with High Probability Guarantees., , , и . STACS, том 25 из LIPIcs, стр. 470-481. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)Unsplittable Flow on a Path: The Game!., , и . SODA, стр. 906-926. SIAM, (2022)