1389 search results - page 71 / 278 » Improved Approximation Algorithms for Label Cover Problems |
141
click to vote
KDD
2008
ACM
16 years 3 months ago
2008
ACM
Transactional data are ubiquitous. Several methods, including frequent itemsets mining and co-clustering, have been proposed to analyze transactional databases. In this work, we p...
125
click to vote
HEURISTICS
2006
15 years 2 months ago
2006
Multiobjective optimization deals with problems involving multiple measures of performance that should be optimized simultaneously. In this paper we extend bucket elimination (BE),...
100
Voted
DAM
2007
15 years 2 months ago
2007
We give a short proof of a result of Tovey [6] on the inapproximability of a scheduling problem known as precedence constrained class sequencing. In addition, we present an approxi...
129
click to vote
CCCG
2010
15 years 4 months ago
2010
In the Euclidean TSP with neighborhoods (TSPN), we are given a collection of n regions (neighborhoods) and we seek a shortest tour that visits each region. In the path variant, we...
122
click to vote
ESA
2006
Springer
15 years 6 months ago
2006
Springer
The objective of this paper is to characterize classes of problems for which a greedy algorithm finds solutions provably close to optimum. To that end, we introduce the notion of k...