7015 search results - page 92 / 1403 » Approximation algorithms for co-clustering |
JCO
2007
13 years 9 months ago
2007
Let G = (V, E) be a connected multigraph, whose edges are associated with labels specified by an integer-valued function L : E → N. In addition, each label ℓ ∈ N has a non-...
ICC
2009
IEEE
13 years 7 months ago
2009
IEEE
Abstract-- This paper addresses the problem of traffic grooming in WDM rings in which all traffic emanates from a single node and all other nodes are destination nodes. This "...
STOC
1991
ACM
14 years 20 days ago
1991
ACM
APPROX
2008
Springer
13 years 11 months ago
2008
Springer
SODA
1998
ACM
13 years 10 months ago
1998
ACM