369 search results - page 32 / 74 » Approximation Algorithms for the Bi-criteria Weighted max-cu... |
118
click to vote
RECOMB
2006
Springer
16 years 3 days ago
2006
Springer
Abstract. During evolution, genomes are subject to genome rearrangements that alter the ordering and orientation of genes on the chromosomes. If a genome consists of a single chrom...
COMPGEOM
2005
ACM
15 years 1 months ago
2005
ACM
We illustrate the Link Solver software for computing 1-link shortest paths in weighted regions. The Link Solver implements a prune-and-search method that can be used to approximat...
SODA
2008
ACM
15 years 1 months ago
2008
ACM
Local ratio is a well-known paradigm for designing approximation algorithms for combinatorial optimization problems. At a very high level, a local-ratio algorithm first decomposes ...
SSS
2009
Springer
15 years 6 months ago
2009
Springer
We consider setting up sleep scheduling in sensor networks. We formulate the problem as an instance of the fractional domatic partition problem and obtain a distributed approximati...
KDD
2009
ACM
15 years 6 months ago
2009
ACM
One-Class Collaborative Filtering (OCCF) is a task that naturally emerges in recommender system settings. Typical characteristics include: Only positive examples can be observed, ...