Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
CPM
/
Paper
Approximation Algorithms and Hardness Results for Shortest Path Based Graph Orientations.
Dima Blokh
,
Danny Segev
,
Roded Sharan
Venue
B
CPM
Year
2012
Proceedings
CPM
DBLP record
conf/cpm/BlokhSS12 ↗
Browse the full
CPM paper archive
.