172 search results - page 2 / 35 » Improved approximation for directed cut problems |
102
click to vote
STOC
2010
ACM
15 years 2 months ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
TALG
2008
14 years 9 months ago
2008
In this paper, we study the metrics of negative type, which are metrics (V, d) such that d is an Euclidean metric; these metrics are thus also known as " 2-squared" met...
100
click to vote
ECCC
2000
14 years 9 months ago
2000
We analyze the addition of a simple local improvement step to various known randomized approximation algorithms. Let ' 0:87856 denote the best approximation ratio currently k...
CVPR
2006
IEEE
15 years 3 months ago
2006
IEEE
This paper adds a number of novel concepts into global s/t cut methods improving their efficiency and making them relevant for a wider class of applications in vision where algor...
SODA
1997
ACM
14 years 11 months ago
1997
ACM
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...