Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Shubhang Kulkarni. Hypergraph connectivity augmentation in strongly polynomial time. // Mathematical Programming. – 2026. – DOI: 10.1007/s10107-026-02399-1. – URL: https://doi.org/10.1007/s10107-026-02399-1
Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, & Shubhang Kulkarni (2026). Hypergraph connectivity augmentation in strongly polynomial time. Mathematical Programming. https://doi.org/10.1007/s10107-026-02399-1
Kristóf Bérczi, et al. “Hypergraph connectivity augmentation in strongly polynomial time.” Mathematical Programming, 2026. doi:10.1007/s10107-026-02399-1.
@article{Brczi2026,
title = {Hypergraph connectivity augmentation in strongly polynomial time},
author = {Bérczi, Kristóf and Chandrasekaran, Karthekeyan and Király, Tamás and Kulkarni, Shubhang},
journal = {Mathematical Programming},
year = {2026},
doi = {10.1007/s10107-026-02399-1},
url = {https://doi.org/10.1007/s10107-026-02399-1}
}