Sciweavers

62 search results - page 7 / 13
» ipl 2010
Sort
View
IPL
2010
69views more  IPL 2010»
13 years 8 months ago
On the additive constant of the k-server Work Function Algorithm
We consider the Work Function Algorithm for the k-server problem [2, 3]. We show that if the Work Function algorithm is c-competitive, then it is also strictly (2c)-competitive. A...
Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Ro...
IPL
2010
111views more  IPL 2010»
13 years 8 months ago
Connecting face hitting sets in planar graphs
We show that any face hitting set of size n of a connected planar graph with a minimum degree of at least 3 is contained in a connected subgraph of size 5n − 6. Furthermore we s...
Pascal Schweitzer, Patrick Schweitzer
IPL
2010
160views more  IPL 2010»
13 years 8 months ago
Antimagic labeling and canonical decomposition of graphs
An antimagic labeling of a connected graph with m edges is an injective assignment of labels from {1, . . . , m} to the edges such that the sums of incident labels are distinct at...
Michael D. Barrus
IPL
2010
107views more  IPL 2010»
13 years 8 months ago
Disjoint pattern matching and implication in strings
We deal with the problem of deciding whether a given set of string patterns implies the presence of a fixed pattern. While checking whether a set of patterns occurs in a string i...
Leonid Libkin, Cristina Sirangelo
IPL
2010
80views more  IPL 2010»
13 years 8 months ago
The reachability problem for branching vector addition systems requires doubly-exponential space
Branching vector addition systems are an extension of vector addition systems where new reachable vectors may be obtained by summing two reachable vectors and adding an integral v...
Ranko Lazic