1389 search results - page 38 / 278 » Improved Approximation Algorithms for Label Cover Problems |
117
click to vote
AE
2009
Springer
15 years 24 days ago
2009
Springer
Abstract. This paper presents a new Memetic Algorithm (MA) designed to compute near-optimal solutions for the covering array construction problem. It incorporates several distingui...
WEA
2005
Springer
15 years 5 months ago
2005
Springer
We present a general framework for approximating several NP-hard problems that have two underlying properties in common. First, the problems we consider can be formulated as intege...
105
click to vote
KDD
2008
ACM
16 years 2 days ago
2008
ACM
Information diffusion, viral marketing, and collective classification all attempt to model and exploit the relationships in a network to make inferences about the labels of nodes....
126
click to vote
ESA
2011
Springer
13 years 11 months ago
2011
Springer
In this work we study the problem of Bipartite Correlation Clustering (BCC), a natural bipartite counterpart of the well studied Correlation Clustering (CC) problem. Given a bipart...
AAIM
2008
Springer
15 years 6 months ago
2008
Springer
This paper deals with the maximum triangle packing problem. For this problem, Hassin and Rubinstein gave a randomized polynomial-time approximation algorithm that achieves an expe...