Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
IPCO
/
Paper
Approximation Algorithms for the Minimum Cardinality Two-Connected Spanning Subgraph Problem.
Prabhakar Gubbala
,
Balaji Raghavachari
Venue
B
IPCO
Year
2005
Proceedings
IPCO
DBLP record
conf/ipco/GubbalaR05 ↗
Browse the full
IPCO paper archive
.