Sciweavers

70 search results - page 5 / 14
» icalp 2007
Sort
View
ICALP
2007
Springer
15 years 3 months ago
A Combinatorial Theorem for Trees
Following the idea developed by I. Simon in his theorem of Ramseyan factorisation forests, we develop a result of ‘deterministic factorisations’. This extra determinism propert...
Thomas Colcombet
ICALP
2007
Springer
15 years 3 months ago
Strong Price of Anarchy for Machine Load Balancing
As defined by Aumann in 1959, a strong equilibrium is a Nash equilibrium that is resilient to deviations by coalitions. We give tight bounds on the strong price of anarchy for loa...
Amos Fiat, Haim Kaplan, Meital Levy, Svetlana Olon...
ICALP
2007
Springer
15 years 3 months ago
Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs
We study the problem of finding occurrences of motifs in vertex-colored graphs, where a motif is a multiset of colors, and an occurrence of a motif is a subset of connected vertic...
Michael R. Fellows, Guillaume Fertin, Danny Hermel...
ICALP
2007
Springer
15 years 3 months ago
Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems
Abstract. We define and study two versions of the bipartite matching problem in the framework of two-stage stochastic optimization with recourse. In one version the uncertainty is...
Irit Katriel, Claire Kenyon-Mathieu, Eli Upfal
ICALP
2007
Springer
15 years 3 months ago
Reachability-Time Games on Timed Automata
d Abstract) Marcin Jurdzi´nski and Ashutosh Trivedi Department of Computer Science, University of Warwick, UK In a reachability-time game, players Min and Max choose moves so that...
Marcin Jurdzinski, Ashutosh Trivedi