( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Round and Bipartize for Vertex Cover Approximation.

, и . APPROX/RANDOM, том 275 из LIPIcs, стр. 20:1-20:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)

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.

Guido Schäfer

Guido Schäfer

Guido Schäfer

Bruno Remo Guidotti

Sauter Guido

 

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

Average-Case and Smoothed Competitive Analysis of the Multilevel Feedback Algorithm, , , , и . Math. Oper. Res., 31 (1): 85-108 (2006)To Trust or Not to Trust: Assignment Mechanisms with Predictions in the Private Graph Model., , , и . CoRR, (2024)Round and Bipartize for Vertex Cover Approximation., и . APPROX/RANDOM, том 275 из LIPIcs, стр. 20:1-20:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Using Machine Learning Predictions to Speed-up Dijkstra's Shortest Path Algorithm., и . CoRR, (2021)Computation and efficiency of potential function minimizers of combinatorial congestion games., и . Math. Program., 190 (1): 523-560 (2021)The enriched median routing problem and its usefulness in practice., , , и . Comput. Ind. Eng., (2022)Cost Sharing over Combinatorial Domains., , и . ACM Trans. Economics and Comput., 10 (1): 4:1-4:26 (2022)Learning-Enhanced Neighborhood Selection for the Vehicle Routing Problem with Time Windows., , , и . CoRR, (2024)Budget-Feasible Mechanism Design for Non-monotone Submodular Objectives: Offline and Online., , и . Math. Oper. Res., 47 (3): 2286-2309 (2022)Budget Feasible Mechanisms for Procurement Auctions with Divisible Agents., и . SAGT, том 13584 из Lecture Notes in Computer Science, стр. 78-93. Springer, (2022)