This site uses cookies to deliver our services and to ensure you get the best experience. By continuing to use this site, you consent to our use of cookies and acknowledge that you have read and understand our Privacy Policy, Cookie Policy, and Terms
We present a method for the precise determination of the volume of subsets of Rd which are bounded by a hypersurface parametrized by a set of refinable functions. The derivation i...
Abstract. Co-clustering, that is, partitioning a matrix into “homogeneous” submatrices, has many applications ranging from bioinformatics to election analysis. Many interesting...
Laurent Bulteau, Vincent Froese, Sepp Hartung, Rol...
Given an interval graph and integer k, we consider the problem of finding a subgraph of size k with a maximum number of induced edges, called densest k-subgraph problem in interv...
We consider several variants of a basic resource replication problem in this paper, and propose new approximation results for them. These problems are of fundamental interest in th...