Competitive online multicommodity routing
type: Item
instance of: scholarly article
title: Competitive online multicommodity routing
zbMATH Open document ID: 1175.90097
author: Tobias Harks
author: Stefan Heinz
author: Marc E. Pfetsch
published in: Theory of Computing Systems
publication date: 2009-09-02T00:00:00Z
full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary
Mathematics Subject Classification ID: 90B20
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 5601535
zbMATH Keywords: online network optimization
zbMATH Keywords: multicommodity routing
zbMATH Keywords: competitive analysis
zbMATH Keywords: unsplittable flow
MaRDI profile type: Publication
OpenAlex ID: W2050307721
cites work: Competitive routing in networks with polynomial costs
cites work: Q4252723
cites work: The Price of Routing Unsplittable Flow
cites work: Q4223058
cites work: Q4821526
cites work: Über ein Paradoxon aus der Verkehrsplanung
cites work: Tight Bounds for Selfish and Greedy Load Balancing
cites work: The price of anarchy of finite congestion games
cites work: The Impact of Oligopolistic Competition in Networks
cites work: Selfish Routing in Capacitated Networks
cites work: Traffic assignment problem for a general network
cites work: Q5414563
cites work: Online algorithms. The state of the art
cites work: Increasing internet capacity using local search
cites work: Q4198056
cites work: Geometric algorithms and combinatorial optimization.
cites work: Competitive Online Multicommodity Routing
cites work: A class of games possessing pure-strategy Nash equilibria
cites work: Selfish routing with atomic players
cites work: How bad is selfish routing?
cites work: Selfish load balancing and atomic congestion games
DOI: 10.1007/S00224-009-9187-5
description: scientific article; zbMATH DE number 5601535