447 search results - page 35 / 90 » Approximation Algorithms for Directed Steiner Problems |
IPL
2011
13 years 3 months ago
2011
The segment minimization problem consists of representing an integer matrix as the sum of the fewest number of integer matrices each of which have the property that the non-zeroes...
ICANN
2007
Springer
14 years 2 months ago
2007
Springer
Finding the largest linearly separable set of examples for a given Boolean function is a NP-hard problem, that is relevant to neural network learning algorithms and to several prob...
ENDM
2010
13 years 8 months ago
2010
Abstract We study the version of the asymmetric prize collecting traveling salesman problem, where the objective is to find a directed tour that visits a subset of vertices such th...
JOIN
2007
13 years 8 months ago
2007
This paper is devoted to the following incremental problem. Initially, a graph and a distinguished subset of vertices, called initial group, are given. This group is connected by ...
SODA
1997
ACM
13 years 9 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...