626 search results - page 33 / 126 » On Approximability of Minimum Bisection Problem |
121
click to vote
SODA
2012
ACM
13 years 3 days ago
2012
ACM
Given an undirected graph with edge lengths and a subset of nodes (called the terminals), the multiway cut (also called the multi-terminal cut) problem asks for a subset of edges,...
STOC
2002
ACM
15 years 10 months ago
2002
ACM
The Minimum Vertex Cover problem is the problem of, given a graph, finding a smallest set of vertices that touches all edges. We show that it is NP-hard to approximate this proble...
WADS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We consider minimum equivalent digraph problem, its maximum optimization variant and some non-trivial extensions of these two types of problems motivated by biological an...
ADHOCNOW
2005
Springer
15 years 3 months ago
2005
Springer
We study the problem of computing multicast trees with minimal bandwidth consumption in multi-hop wireless mesh networks. For wired networks, this problem is known as the Steiner t...
INFOCOM
2008
IEEE
15 years 4 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...