Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

71

MOR
2010

favoriteEmaildiscussreport

58views more MOR 2010»

Stackelberg Routing in Arbitrary Networks

14 years 8 months ago

Stackelberg Routing in Arbitrary Networks

Download www.math.tu-berlin.de

Vincenzo Bonifaci, Tobias Harks, Guido Schäfe

Real-time Traffic

MOR 2010 |

claim paper

Related Content

» A Stackelberg Strategy for Routing Flow over Time

» Stackelberg Strategies and Collusion in Network Games with Splittable Flow

» Design of Incentive Compatible Mechanisms for Stackelberg Problems

» Security Games with Arbitrary Schedules A Branch and Price Approach

» Highperformance adaptive routing for networks with arbitrary topology

» An Efficient Algorithm for Optimal Wavelength Converter Placement on WavelengthRouted Netw...

» Most Reliable Routing in WDM Mesh Networks with Arbitrary Risk Distribution

» Optimal Geographic Routing for Wireless Networks with NearArbitrary Holes and Traffic

» Design Guidelines for Routing Metrics in Multihop Wireless Networks

Post Info
More Details (n/a)

Added	29 Jan 2011
Updated	29 Jan 2011
Type	Journal
Year	2010
Where	MOR
Authors	Vincenzo Bonifaci, Tobias Harks, Guido Schäfer

Comments (0)