ESA
2007
Springer
13 years 8 months ago
2007
Springer
We present a complete, exact and efficient implementation to compute the adjacency graph of an arrangement of quadrics, i.e. surfaces of algebraic degree 2. This is a major step t...
ESA
2007
Springer
13 years 8 months ago
2007
Springer
Abstract. In the present work, we are interested in the practical behavior of a new fptas to solve the approximation version of the 0-1 multiobjective knapsack problem. Nevertheles...
ESA
2007
Springer
13 years 8 months ago
2007
Springer
A token is hidden in one out of n boxes following some known probability distribution and then all the boxes are locked. The goal of a searcher is to find the token in at most D n...
ESA
2007
Springer
13 years 8 months ago
2007
Springer
We consider the problem of pricing items so as to maximize the profit made from selling these items. An instance is given by a set E of n items and a set of m clients, where each c...
ESA
2007
Springer
13 years 8 months ago
2007
Springer
We consider the price of selfish routing in terms of tradeoffs and from an average-case perspective. Each player in a network game seeks to send a message with a certain length by...
ESA
2007
Springer
13 years 8 months ago
2007
Springer
ESA
2007
Springer
13 years 10 months ago
2007
Springer
Given a graph G = (V, E), a (d, k)-coloring is a function from the vertices V to colors {1, 2, . . . , k} such that any two vertices within distance d of each other are assigned di...
ESA
2007
Springer
13 years 10 months ago
2007
Springer
ESA
2007
Springer
13 years 10 months ago
2007
Springer
ESA
2007
Springer
13 years 10 months ago
2007
Springer
We present an algorithm for finding frequent elements in a stream where the arrivals are not bursty. Depending on the amount of burstiness in the stream our algorithm detects elem...