982 search results - page 65 / 197 » Solving Steiner tree problems in graphs to optimality |
100
click to vote
DISOPT
2008
15 years 21 days ago
2008
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...
119
click to vote
COCOA
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
122
click to vote
FSTTCS
2009
Springer
15 years 7 months ago
2009
Springer
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
ANOR
2008
15 years 23 days ago
2008
We describe a class of problems motivated by numerous real-world applications where there is a collection of objects that have both a cost and a value, but where some of those obj...
127
Voted
SODA
2010
ACM
14 years 10 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...