Improved algorithms for the multicut and multiflow problems in rooted trees
Year of publication: |
2008
|
---|---|
Authors: | Tamir, A. |
Published in: |
TOP: An Official Journal of the Spanish Society of Statistics and Operations Research. - Springer. - Vol. 16.2008, 1, p. 114-125
|
Publisher: |
Springer |
Subject: | Maximum integral multiflows | Minimum multicuts | Totally balanced matrices | Greedy matrices | Rooted trees |
-
The Evolution of Collective Action
Myatt, David P., (2005)
-
N-trees as nestings: Complexity, similarity, and consensus
Adams, Edward, (1986)
- More ...
-
Polynomially Bounded Algorithms for Locating p-Centres on a Tree
Chandrasekaran, R., (1978)
-
An O((n lOg p)2) Algorithm for the Continous P-Center Problem on a Tree
Chandrasekaran, R., (1979)
-
On the Complexity of Point Covering and Line Covering
Meggido, N., (1981)
- More ...