Article thumbnail

Approximating Minimum-Cost k-Node Connected Subgraphs via Independence-Free Graphs

By Joseph Cheriyan and Laszlo A. Vegh
Publisher: 'Institute of Electrical and Electronics Engineers (IEEE)'
Year: 2014
DOI identifier: 10.1109/focs.2013.12
OAI identifier:
Provided by: Crossref
Sorry, our data provider has not provided any external links therefore we are unable to provide a link to the full text.

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.

Suggested articles