3875 search results - page 54 / 775 » Approximation algorithms for the 0-extension problem |
SODA
2012
ACM
13 years 3 days ago
2012
ACM
The Directed Steiner Tree (DST) problem is a cornerstone problem in network design. We focus on the generalization of the problem with higher connectivity requirements. The proble...
ORL
2006
14 years 9 months ago
2006
We give a (1 - 1/e)-approximation algorithm for the Max-Profit Generalized Assignment Problem (Max-GAP) with fixed profits when the profit (but not necessarily the size) of every ...
109
click to vote
APPROX
2000
Springer
15 years 2 months ago
2000
Springer
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
ESANN
2000
14 years 11 months ago
2000
Iterative algorithm based on quantum tunneling is proposed by making use of mean- eld approximation. W e apply our method to the problem of BW image reconstruction (IR). Its perfor...
ICALP
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...