Sciweavers

2 search results - page 1 / 1
» The k-path tree matroid and its applications to survivable n...
Sort
View
DISOPT
2008
107views more  DISOPT 2008»
13 years 5 months ago
The k-path tree matroid and its applications to survivable network design
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...
Esther M. Arkin, Refael Hassin
FSTTCS
2009
Springer
13 years 11 months ago
Iterative Methods in Combinatorial Optimization
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...
R. Ravi