Efficient and fair routing for mesh networks
From MaRDI portal
Publication:2638366
DOI10.1007/s10107-010-0356-8zbMath1200.90041MaRDI QIDQ2638366
Nicolás E. Stier-Moses, Andrea Lodi, Enrico Malaguti
Publication date: 16 September 2010
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-010-0356-8
90B18: Communication networks in operations research
68M10: Network design and communication in computer systems
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
Related Items
The vertex coloring problem and its generalizations, On the efficiency of equilibria in mean-field oscillator games, Efficient and fair routing for mesh networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multicriteria optimization
- Efficient and fair routing for mesh networks
- Fast, Fair, and Efficient Flows in Networks
- A Theory of Exit in Duopoly
- System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion
- Algorithmic Game Theory
- Emergency Connectivity in Ad-Hoc Networks with Selfish Nodes