| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428712 | Information Processing Letters | 2009 | 4 Pages |
Abstract
We show that a simple randomized algorithm has an expected constant factor approximation guarantee for fitting bucket orders to a set of pairwise preferences.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
