Exact and approximate truthful mechanisms for the shortest paths tree problem (Q2461546): Difference between revisions

@@ Property / cites work @@
+Q4542546
@@ Property / cites work: Q4542546 / rank @@
+Normal rank
@@ Property / cites work @@
+A minimum spanning tree algorithm with inverse-Ackermann type complexity
+Normal rank
@@ Property / cites work @@
+Incentives in Teams
@@ Property / cites work: Incentives in Teams / rank @@
+Normal rank
@@ Property / cites work @@
+Computing and Combinatorics
@@ Property / cites work: Computing and Combinatorics / rank @@
+Normal rank
@@ Property / cites work @@
+The k most vital arcs in the shortest path problem
+Normal rank
@@ Property / cites work @@
+A faster computation of the most vital edge of a shortest path
+Normal rank
@@ Property / cites work @@
+Polynomial time algorithms for 2-edge-connectivity augmentation problems
+Normal rank
@@ Property / cites work @@
+Finding the most vital node of a shortest path.
@@ Property / cites work: Finding the most vital node of a shortest path. / rank @@
+Normal rank
@@ Property / cites work @@
+Nearly linear time minimum spanning tree maintenance for transient node failures
+Normal rank
@@ Property / cites work @@
+Algorithmic mechanism design
@@ Property / cites work: Algorithmic mechanism design / rank @@
+Normal rank
@@ Property / cites work @@
+Q3576736
@@ Property / cites work: Q3576736 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4828943
@@ Property / cites work: Q4828943 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficiency of a Good But Not Linear Set Union Algorithm
+Normal rank