Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
SODA
/
Paper
Polylogarithmic Bounds on the Competitiveness of Min-cost Perfect Matching with Delays.
Yossi Azar
,
Ashish Chiplunkar
,
Haim Kaplan
Venue
A*
SODA
Year
2017
Proceedings
SODA
DBLP record
conf/soda/AzarCK17 ↗
Browse the full
SODA paper archive
.