3894 search results - page 419 / 779 » Approximation Algorithms for Biclustering Problems |
145
click to vote
SPAA
2004
ACM
15 years 10 months ago
2004
ACM
This paper considers the problem of packet-mode scheduling of input queuedswitches. Packets have variable lengths, and are divided into cells of unit length. Each packet arrives t...
151
click to vote
STOC
2006
ACM
16 years 5 months ago
2006
ACM
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
145
click to vote
INFOCOM
2008
IEEE
15 years 11 months ago
2008
IEEE
—IEEE 802.11 WiFi equipment based wireless mesh networks have recently been proposed as an inexpensive approach to connect far-flung rural areas. Such networks are built using h...
112
click to vote
FSTTCS
2008
Springer
15 years 5 months ago
2008
Springer
Given an edge-weighted undirected graph G with a specified set of terminals, let the density of any subgraph be the ratio of its weight/cost to the number of terminals it contain...
127
click to vote
ESA
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We study an extensive class of movement minimization problems which arise from many practical scenarios but so far have little theoretical study. In general, these proble...