( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint.

, , и . APPROX-RANDOM, том 81 из LIPIcs, стр. 11:1-11:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (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.

Chien-Chung Huang

Chien-Chung Fu

Jung-Chien Huang

Yu-chung Huang

Chung-cheng Huang

 

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

Streaming Algorithms for Maximizing Monotone Submodular Functions Under a Knapsack Constraint., , и . Algorithmica, 82 (4): 1006-1032 (2020)AEP-DLA: Adverse Event Prediction in Hospitalized Adult Patients Using Deep Learning Algorithms., , , , , , , , и . IEEE Access, (2021)Robust Sparsification for Matroid Intersection with Applications., и . SODA, стр. 2916-2940. SIAM, (2024)Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver., , , , , и . ICALP, том 229 из LIPIcs, стр. 37:1-37:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Robust Sparsification for Matroid Intersection with Applications., и . CoRR, (2023)Matroid-Constrained Maximum Vertex Cover: Approximate Kernels and Streaming Algorithms., и . SWAT, том 227 из LIPIcs, стр. 27:1-27:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Approximating maximum integral multiflows on bounded genus graphs., , , и . CoRR, (2020)Approximating Maximum Integral Multiflows on Bounded Genus Graphs., , , и . ICALP, том 198 из LIPIcs, стр. 80:1-80:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Improved Multi-Pass Streaming Algorithms for Submodular Maximization with Matroid Constraints., , и . APPROX-RANDOM, том 176 из LIPIcs, стр. 62:1-62:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint., , и . APPROX-RANDOM, том 81 из LIPIcs, стр. 11:1-11:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)