840 search results - page 4 / 168 » Inapproximability of Combinatorial Optimization Problems |
IPL
2007
13 years 9 months ago
2007
We study the approximability and inapproximability of finding identifying codes and locating-dominating codes of the minimum size. In general graphs, we show that it is possible ...
IBIS
2006
13 years 9 months ago
2006
: Schema matching is the task of finding semantic correspondences between elements of two schemas, which plays a key role in many database applications. In this paper, we cast the ...
COCO
2006
Springer
14 years 1 months ago
2006
Springer
We consider the problem of finding a monomial (or a term) that maximizes the agreement rate with a given set of examples over the Boolean hypercube. The problem is motivated by le...
COLOGNETWENTE
2010
13 years 8 months ago
2010
We present an algorithm for the independent set problem on semi-random graphs, which are generated as follows: An adversary chooses an n-vertex graph, and then each edge is flipp...
CORR
2011
Springer
13 years 4 months ago
2011
Springer
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...