Pages that link to "Item:Q2461546"

The following pages link to Exact and approximate truthful mechanisms for the shortest paths tree problem (Q2461546):

Displaying 3 items.

• A faster computation of all the best swap edges of a shortest paths tree (Q893317) (← links)
• New bounds for truthful scheduling on two unrelated selfish machines (Q2300622) (← links)
• Path-Fault-Tolerant Approximate Shortest-Path Trees (Q3460718) (← links)