Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
IPCO
/
Paper
An O(log n)-Approximation Algorithm for (p, q)-Flexible Graph Connectivity via Independent Rounding.
Sharat Ibrahimpur
,
Lszl A. Vgh
Venue
B
IPCO
Year
2025
Proceedings
IPCO
DBLP record
conf/ipco/IbrahimpurV25 ↗
Browse the full
IPCO paper archive
.