English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse
  1. View item / 
  2. Item Summary

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

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

MPS-Authors
/persons/resource/persons44225

Chalermsook,  Parinya
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44648

Huang,  Chien-Chung
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45102

Nanongkai,  Danupon       
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons79464

Saranurak,  Thatchaphol
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)

LIPIcs.ICALP.2022.37.pdf
(Publisher version), 929KB

Supplementary Material (public)
There is no public supplementary material available
Citation

Chalermsook, P., Huang, C.-C., Nanongkai, D., Saranurak, T., Sukprasert, P., & Yingchareonthawornchai, S. (2022). Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver. In M. Bojańczyk, E. Merelli, & D. P. Woodruff (Eds.), 49th EATCS International Conference on Automata, Languages, and Programming (pp. 1-20). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.ICALP.2022.37.


Cite as: https://hdl.handle.net/21.11116/0000-000E-6D7C-E
Abstract
There is no abstract available