( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Tight approximation bounds for dominating set on graphs of bounded arboricity.

, и . Inf. Process. Lett., (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.

William Jórasz

William Masselink

William Meany

William Pierson

William Herz

 

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

Tight Bounds for Online Weighted Tree Augmentation., , и . Algorithmica, 84 (2): 304-324 (2022)Tight approximation bounds for dominating set on graphs of bounded arboricity., и . Inf. Process. Lett., (2017)On the Extended TSP Problem., , и . ISAAC, том 212 из LIPIcs, стр. 42:1-42:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Online Probabilistic Metric Embedding: A General Framework for Bypassing Inherent Bounds., , и . SODA, стр. 1538-1557. SIAM, (2020)The Power of Clairvoyance for Multi-Level Aggregation and Set Cover with Delay., , и . SODA, стр. 1594-1610. SIAM, (2023)Brief Announcement: Nested Active-Time Scheduling., , , , , и . SPAA, стр. 381-383. ACM, (2022)The Online Broadcast Range-Assignment Problem., , и . Algorithmica, 85 (12): 3928-3956 (декабря 2023)LAST but not Least: Online Spanners for Buy-at-Bulk., , , и . SODA, стр. 589-599. SIAM, (2017)The Online Broadcast Range-Assignment Problem., , и . ISAAC, том 181 из LIPIcs, стр. 60:1-60:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Online Constrained Forest and Prize-Collecting Network Design., , и . CoRR, (2017)