3192 search results - page 56 / 639 » The minimum latency problem |
CORR
2007
Springer
14 years 10 months ago
2007
Springer
— This work considers the problem of transmitting multiple compressible sources over a network with minimum cost. The problem is complicated by the fact that the description of t...
109
click to vote
FOCS
2000
IEEE
15 years 2 months ago
2000
IEEE
A bisection of a graph with n vertices is a partition of its vertices into two sets, each of size n/2. The bisection cost is the number of edges connecting the two sets. The proble...
IPL
2010
14 years 8 months ago
2010
We show that the problem of computing a minimum distortion embedding of a given graph into a path remains NP-hard when the input graph is restricted to a bipartite, cobipartite, o...
101
click to vote
APPROX
2007
Springer
15 years 4 months ago
2007
Springer
We investigate the problem of computing a minimum set of solutions that approximates within a specified accuracy the Pareto curve of a multiobjective optimization problem. We show...
ISAAC
2007
Springer
15 years 4 months ago
2007
Springer
We study the complexity of structurally restricted homomorphism and constraint satisfaction problems. For every class of relational structures C, let LHOM(C, _) be the problem of d...