743 search results - page 43 / 149 » Approximation Algorithms for Graph Homomorphism Problems |
299
Voted
AAIM
2011
Springer
14 years 7 months ago
2011
Springer
A star forest is a collection of vertex-disjoint trees of depth at most 1, and its size is the number of leaves in all its components. A spanning star forest of a given graph G is ...
130
Voted
APPROX
2006
Springer
15 years 7 months ago
2006
Springer
Inspired by Feige (36th STOC, 2004), we initiate a study of sublinear randomized algorithms for approximating average parameters of a graph. Specifically, we consider the average ...
144
click to vote
NIPS
2004
15 years 5 months ago
2004
Various problems in machine learning, databases, and statistics involve pairwise distances among a set of objects. It is often desirable for these distances to satisfy the propert...
185
click to vote
COCOON
2010
Springer
15 years 2 months ago
2010
Springer
The problem of sorting permutations by double-cut-and-joins (SBD) arises when we perform the double-cut-and-join (DCJ) operations on pairs of unichromosomal genomes without the gen...
152
click to vote
CORR
2011
Springer
14 years 7 months ago
2011
Springer
A hitting set for a collection of sets is a set that has a nonempty intersection with each set in the collection; the hitting set problem is to find a hitting set of minimum card...