68 search results - page 5 / 14 » esas 2007 |
ESA
2007
Springer
14 years 1 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
14 years 1 months ago
2007
Springer
Given a (directed or undirected) graph with edge costs, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of its n...
ESAS
2007
Springer
14 years 1 months ago
2007
Springer
Introducing a new device to a network or to another device is one of the most security critical phases of communication in personal networks. There have been several different pro...
ESA
2007
Springer
13 years 11 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
14 years 1 months ago
2007
Springer
We introduce a general framework for processing a set of curves defined on a continuous two-dimensional parametric surface, while sweeping the parameter space. We can handle plan...