1629 search results - page 165 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
108
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Abstract Anna Blasiak Robert Kleinberg Eyal Lubetzky Index Coding has received considerable attention recently motivated in part by applications such as fast video-on-demand and e...
PODC
2005
ACM
15 years 4 months ago
2005
ACM
In this paper we consider the weighted, capacitated vertex cover problem with hard capacities (capVC). Here, we are given an undirected graph G = (V, E), non-negative vertex weigh...
100
click to vote
EPS
1998
Springer
15 years 2 months ago
1998
Springer
This paper discusses a simple representation of variable-dimensional optimization problems for evolutionary algorithms. Although it was successfully applied to the optimization of ...
108
click to vote
ER
2005
Springer
15 years 4 months ago
2005
Springer
Abstract. Understanding a large schema without the assistance of persons already familiar with it (and its associated applications), is a hard and very time consuming task that occ...
NETWORKING
2007
14 years 12 months ago
2007
Most routing algorithms for sensor networks focus on finding energy efficient paths to prolong the lifetime of sensor networks. As a result, the sensors on the efficient paths are ...