( en | de | ru )

 

Disambiguation of "Huang, Chien-Chung"

Author of the publication

copydeleteadd this publication to your clipboard
Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model.

, , , and . CoRR, (2020)

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. You can also use the button next to the name to display some publications already assigned to the person.

Chien-Chung Huang

Chien-Chung Fu

Jung-Chien Huang

Yu-chung Huang

Chung-cheng Huang

 

Other publications of authors with the same name

Robust Sparsification for Matroid Intersection with Applications., and . SODA, page 2916-2940. SIAM, (2024)Robust Sparsification for Matroid Intersection with Applications., and . CoRR, (2023)Matroid-Constrained Maximum Vertex Cover: Approximate Kernels and Streaming Algorithms., and . SWAT, volume 227 of LIPIcs, page 27:1-27:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver., , , , , and . ICALP, volume 229 of LIPIcs, page 37:1-37:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint., , and . APPROX-RANDOM, volume 81 of LIPIcs, page 11:1-11:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Approximating Maximum Integral Multiflows on Bounded Genus Graphs., , , and . ICALP, volume 198 of LIPIcs, page 80:1-80:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Improved Multi-Pass Streaming Algorithms for Submodular Maximization with Matroid Constraints., , and . APPROX-RANDOM, volume 176 of LIPIcs, page 62:1-62:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Automatic taxonomy generation for speech archives., , , and . ISCSLP, ISCA, (2002)Distributed Exact Weighted All-Pairs Shortest Paths in Õ(n5/4) Rounds., , and . CoRR, (2017)Maximizing Covered Area in the Euclidean Plane with Connectivity Constraint., , , , and . APPROX-RANDOM, volume 145 of LIPIcs, page 32:1-32:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)