Publication:4829039
From MaRDI portal
zbMath1093.68609MaRDI QIDQ4829039
Publication date: 29 November 2004
90C35: Programming involving graphs or networks
68R10: Graph theory (including graph drawing) in computer science
Related Items
Preemptive Scheduling on Selfish Machines, Maximizing the Minimum Load for Selfish Agents, Frugal Routing on Wireless Ad-Hoc Networks, Distributed algorithmic mechanism design for scheduling on unrelated machines, Coordination mechanisms, Computationally-feasible truthful auctions for convex bundles, A monotone approximation algorithm for scheduling with precedence constraints, The path player game, Path auctions with multiple edge ownership, Approximation and collusion in multicast cost sharing, A BGP-based mechanism for lowest-cost routing, Mechanism design for policy routing, Fault tolerant mechanism design, On certain connectivity properties of the internet topology, How much can taxes help selfish routing?, Competitive auctions, First-passage percolation on a ladder graph, and the path cost in a VCG auction