743 search results - page 41 / 149 » Approximation Algorithms for Graph Homomorphism Problems |
FSTTCS
2007
Springer
14 years 2 months ago
2007
Springer
We study several cost coloring problems, where we are given a graph and a cost function on the independent sets and are to find a coloring that minimizes the function costs of the...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
An optimization problem that naturally arises in the study of swarm robotics is the Freeze-Tag Problem (FTP) of how to awaken a set of "asleep" robots, by having an awak...
TCS
2011
13 years 2 months ago
2011
The problem of computing minimum distortion embeddings of a given graph into a line (path) was introduced in 2004 and has quickly attracted significant attention with subsequent ...
IPCO
2001
13 years 9 months ago
2001
Garg [10] gives two approximation algorithms for the minimum-cost tree spanning k vertices in an undirected graph. Recently Jain and Vazirani [16] discovered primal-dual approxima...
JDA
2007
13 years 7 months ago
2007
Given an undirected graph G = (V,E) and a source vertex s ∈ V , the k-traveling repairman (KTR) problem, also known as the minimum latency problem, asks for k tours, each starti...