7015 search results - page 333 / 1403 » Approximation algorithms for co-clustering |
234
click to vote
WG
2004
Springer
16 years 1 days ago
2004
Springer
A unit disk graph is the intersection graph of unit disks in the euclidean plane. We present a polynomial-time approximation scheme for the maximum weight independent set problem i...
186
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
In the Survivable Network Design Problem (SNDP) one seeks to find a minimum cost subgraph that satisfies prescribed node-connectivity requirements. We give a novel approximation r...
197
click to vote
WABI
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. The orientation of physical networks is a prime task in deciphering the signaling-regulatory circuitry of the cell. One manifestation of this computational task is as a m...
155
click to vote
COMPGEOM
2007
ACM
15 years 10 months ago
2007
ACM
We consider the problem of approximating a set P of n points in Rd by a collection of j-dimensional flats, and extensions thereof, under the standard median / mean / center measur...
166
click to vote
ECAI
2006
Springer
15 years 10 months ago
2006
Springer
The fundamental operation of dominance testing, i.e., determining if one alternative is preferred to another, is in general very hard for methods of reasoning with qualitative cond...