Sciweavers

45 search results - page 5 / 9
» mst 2010
Sort
View
MST
2010
78views more  MST 2010»
13 years 8 months ago
Sensitivity of Wardrop Equilibria
We study the sensitivity of equilibria in the well-known game theoretic traffic model due to Wardrop. We mostly consider single-commodity networks. Suppose, given a unit demand fl...
Matthias Englert, Thomas Franke, Lars Olbrich
MST
2010
110views more  MST 2010»
13 years 8 months ago
Facets of the Fully Mixed Nash Equilibrium Conjecture
In this work, we continue the study of the many facets of the Fully Mixed Nash Equilibrium Conjecture, henceforth abbreviated as the FMNE Conjecture, in selfish routing for the s...
Rainer Feldmann, Marios Mavronicolas, Andreas Pier...
MST
2010
98views more  MST 2010»
13 years 8 months ago
Why Almost All k-Colorable Graphs Are Easy to Color
Coloring a k-colorable graph using k colors (k ≥ 3) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the unif...
Amin Coja-Oghlan, Michael Krivelevich, Dan Vilench...
MST
2010
111views more  MST 2010»
13 years 8 months ago
Sturmian Trees
We consider Sturmian trees as a natural generalization of Sturmian words. A Sturmian tree is a tree having n + 1 distinct subtrees of height n for each n. As for the case of words,...
Jean Berstel, Luc Boasson, Olivier Carton, Isabell...
MST
2010
140views more  MST 2010»
13 years 8 months ago
Approximability of Clausal Constraints
We study a family of problems, called Maximum Solution (Max Sol), where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variab...
Peter Jonsson, Gustav Nordh