From post

Incomplete List Setting of the Hospitals/Residents Problem with Maximally Satisfying Lower Quotas.

, , и . SAGT, том 13584 из Lecture Notes in Computer Science, стр. 544-561. Springer, (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.

 

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

SAT-Varible Complexity of Hard Combinatorial Problems., и . IFIP Congress (1), том A-51 из IFIP Transactions, стр. 253-258. North-Holland, (1994)A tight bound on online buffer management for two-port shared-memory switches., , и . SPAA, стр. 358-364. ACM, (2007)A 25/17-Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties., , и . ESA (2), том 6347 из Lecture Notes in Computer Science, стр. 135-146. Springer, (2010)Implementation and evaluation of image recognition algorithm for an intelligent vehicle using heterogeneous multi-core SoC., , , , , , и . ASP-DAC, стр. 410-415. IEEE, (2015)Strategy-Proof Approximation Algorithms for the Stable Marriage Problem with Ties and Incomplete Lists., , и . ISAAC, том 149 из LIPIcs, стр. 9:1-9:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)A 1.875: approximation algorithm for the stable marriage problem., , и . SODA, стр. 288-297. SIAM, (2007)Privacy Oriented Attribute Exchange in Shibboleth Using Magic Protocols., , , и . SAINT, стр. 293-296. IEEE Computer Society, (2008)Improving the Competitive Ratios of the Seat Reservation Problem., и . IFIP TCS, том 323 из IFIP Advances in Information and Communication Technology, стр. 328-339. Springer, (2010)Competitive buffer management for multi-queue switches in qos networks using packet buffering algorithms., , и . SPAA, стр. 328-336. ACM, (2009)A (2-c*(1/sqrt(N)))-Approximation Algorithm for the Stable Marriage Problem., , и . ISAAC, том 3827 из Lecture Notes in Computer Science, стр. 902-914. Springer, (2005)