External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver

Parinya Chalermsook, Chien-Chung Huang, Danupon Nanongkai, Thatchaphol Saranurak, Pattara Sukprasert, Sorrachai Yingchareonthawornchai. Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver. In Mikolaj Bojanczyk, Emanuela Merelli, David P. Woodruff, editors, 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, July 4-8, 2022, Paris, France. Volume 229 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. [doi]

Authors

Parinya Chalermsook

This author has not been identified. Look up 'Parinya Chalermsook' in Google

Chien-Chung Huang

This author has not been identified. Look up 'Chien-Chung Huang' in Google

Danupon Nanongkai

This author has not been identified. Look up 'Danupon Nanongkai' in Google

Thatchaphol Saranurak

This author has not been identified. Look up 'Thatchaphol Saranurak' in Google

Pattara Sukprasert

This author has not been identified. Look up 'Pattara Sukprasert' in Google

Sorrachai Yingchareonthawornchai

This author has not been identified. Look up 'Sorrachai Yingchareonthawornchai' in Google
runs on