740 search results - page 2 / 148 » An approximation ratio for biclustering |
GLOBECOM
2010
IEEE
13 years 4 months ago
2010
IEEE
Abstract--All-optical multicast routing (AOMR) is implemented by the concept of light-tree in WDM networks. The costoptimal multicast light-tree is NP-hard to compute, especially w...
CORR
2008
Springer
13 years 6 months ago
2008
Springer
For an edge-weighted connected undirected graph, the minimum k-way cut problem is to find a subset of edges of minimum total weight whose removal separates the graph into k connect...
ICCCN
2008
IEEE
14 years 21 days ago
2008
IEEE
— The current access point (AP) association schemes in wireless LANs, such as IEEE 802.11, cause an unbalanced load which reduces the performance of both the entire network and i...
ICALP
2005
Springer
13 years 11 months ago
2005
Springer
We reduce the approximation factor for Vertex Cover to 2 − Θ( 1√ log n ) (instead of the previous 2 − Θ(log log n log n ), obtained by Bar-Yehuda and Even [2], and by Moni...
ESA
2009
Springer
14 years 25 days ago
2009
Springer
Abstract. The input of the Edge Multicut problem consists of an undirected graph G and pairs of terminals {s1, t1}, . . . , {sm, tm}; the task is to remove a minimum set of edges s...