default search action
"Approximating Minimum-Cost k-Node Connected Subgraphs via ..."
Joseph Cheriyan, László A. Végh (2013)
- Joseph Cheriyan, László A. Végh:
Approximating Minimum-Cost k-Node Connected Subgraphs via Independence-Free Graphs. FOCS 2013: 30-39
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.