7015 search results - page 51 / 1403 » Approximation algorithms for co-clustering |
STOC
1998
ACM
15 years 4 months ago
1998
ACM
Given an undirected graph with edge costs and a subset of k nodes called terminals, a multiway cut is a subset of edges whose removal disconnects each terminal from the rest. Mult...
112
click to vote
JGAA
2007
14 years 11 months ago
2007
The task of finding the largest subset of vertices of a graph that induces a planar subgraph is known as the Maximum Induced Planar Subgraph problem (MIPS). In this paper, some n...
TON
2010
14 years 6 months ago
2010
In this paper, we consider the classical problem of link scheduling in wireless networks under an accurate interference model, in which correct packet reception at a receiver node ...
EUROCAST
2009
Springer
15 years 6 months ago
2009
Springer
In this paper we present new local search algorithms for the Probabilistic Traveling Salesman Problem (PTSP) using sampling and ad-hoc approximation. These algorithms improve both...
OL
2008
14 years 11 months ago
2008
Building on an existing 2-approximate algorithm for the class of network design problems with downwards-monotone demand functions, many of which are NP-hard, we present an algorith...