7015 search results - page 32 / 1403 » Approximation algorithms for co-clustering |
WADS
2005
Springer
14 years 2 months ago
2005
Springer
We consider an APX-hard variant (∆-Max-ATSP) and an APX-hard relaxation (Max-3-DCC) of the classical traveling salesman problem. We present a 31 40-approximation algorithm for â...
SODA
2001
ACM
13 years 10 months ago
2001
ACM
We provide improved approximation algorithms for several rectangle tiling and packing problems (RTILE, DRTILE and d-RPACK) studied in the literature. Our algorithms are highly eff...
DAM
2010
13 years 9 months ago
2010
In this paper we propose a new integer programming formulation for the multilevel facility location problem and a novel 3-approximation algorithm based on LP rounding. The linear ...
NPL
2006
13 years 9 months ago
2006
Abstract. In this paper we introduce a new error measure, integrated reconstruction error (IRE) and show that the minimization of IRE leads to principal eigenvectors (without rotat...
CIAC
2006
Springer
14 years 22 days ago
2006
Springer
In this paper we construct two distributed algorithms for computing approximations of a largest matching and a minimum dominating set in planar graphs on n vertices. The approximat...