Approximate and dynamic rank aggregation (Q1884843): Difference between revisions

@@ Property / cites work @@
+A new rounding procedure for the assignment problem with applications to dense graph arrangement problems
+Normal rank
@@ Property / cites work @@
+Q4234075
@@ Property / cites work: Q4234075 / rank @@
+Normal rank
@@ Property / cites work @@
+Median linear orders: Heuristics and a branch and bound algorithm
+Normal rank
@@ Property / cites work @@
+The median procedure in cluster analysis and social choice theory
+Normal rank
@@ Property / cites work @@
+Voting schemes for which it can be difficult to tell who won the election
+Normal rank
@@ Property / cites work @@
+Approximate sequencing for variable length tasks.
@@ Property / cites work: Approximate sequencing for variable length tasks. / rank @@
+Normal rank
@@ Property / cites work @@
+New results on the computation of median orders
@@ Property / cites work: New results on the computation of median orders / rank @@
+Normal rank
@@ Property / cites work @@
+Q4153936
@@ Property / cites work: Q4153936 / rank @@
+Normal rank
@@ Property / cites work @@
+A Chernoff Bound for Random Walks on Expander Graphs
+Normal rank
@@ Property / cites work @@
+Q4142699
@@ Property / cites work: Q4142699 / rank @@
+Normal rank
@@ Property / cites work @@
+Probabilistic construction of deterministic algorithms: approximating packing integer programs
+Normal rank
@@ Property / cites work @@
+Randomized rounding: A technique for provably good algorithms and algorithmic proofs
+Normal rank