OpenReview
.net
OpenReview
.net
Login
OpenReview
.net
Login
Go to
SIAMCOMP 2014
homepage
Approximating Minimum-Cost k-Node Connected Subgraphs via Independence-Free Graphs
Joseph Cheriyan
,
László A. Végh
Published: 2014, Last Modified: 13 May 2023
SIAM J. Comput. 2014
Readers:
Everyone
0 Replies
Loading