Sciweavers

CAAN
2007
Springer
14 years 21 days ago
Luck vs. Skill
Peter Winkler
CAAN
2007
Springer
14 years 2 months ago
Improving the Efficiency of Helsgaun's Lin-Kernighan Heuristic for the Symmetric TSP
Abstract. Helsgaun has introduced and implemented the lower tolerances (-values) for an approximation of Held-Karp's 1-tree with the purpose to improve the Lin-Kernighan Heuri...
Dirk Richter, Boris Goldengorin, Gerold Jäger...
CAAN
2007
Springer
14 years 2 months ago
Nonadaptive Selfish Routing with Online Demands
We study the efficiency of selfish routing problems in which traffic demands are revealed online. We go beyond the common Nash equilibrium concept in which possibly all players rer...
Tobias Harks, László A. Végh
CAAN
2007
Springer
14 years 2 months ago
Preemptive Scheduling on Selfish Machines
We consider the problem of scheduling on parallel uniformly related machines, where preemptions are allowed and the machines are controlled by selfish agents. Our goal is to minimi...
Leah Epstein, Rob van Stee
CAAN
2007
Springer
14 years 5 months ago
Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm
In the recently introduced model for cleaning a graph with brushes, we use a degree-greedy algorithm to clean a random d-regular graph on n vertices (with dn even). We then use a d...
Margaret-Ellen Messinger, Pawel Pralat, Richard J....
CAAN
2007
Springer
14 years 5 months ago
Vertex Pursuit Games in Stochastic Network Models
Abstract. Random graphs with given expected degrees G(w) were introduced by Chung and Lu so as to extend the theory of classical G(n, p) random graphs to include random power law g...
Anthony Bonato, Pawel Pralat, Changping Wang
CAAN
2007
Springer
14 years 5 months ago
Improving Topological Routing in N2R Networks
Topological routing is basically table free, and allows for very fast restoration and thus a high level of reliability in communication. It has already been satisfactorily proposed...
José M. Gutiérrez López, Rub&...