Adaptive queue-length-based matching policies can be approximated to within (1 minus epsilon) in polynomial time for constant-size networks and for fixed-dimensional Euclidean networks with abandonment.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Adaptive Approximation Schemes for Matching Queues
Adaptive queue-length-based matching policies can be approximated to within (1 minus epsilon) in polynomial time for constant-size networks and for fixed-dimensional Euclidean networks with abandonment.