Efficient algorithms for center problems in cactus networks
Authors:
- 1 June 2007
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 378 (3) , 237-252
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- Parametric search and locating supply centers in trees2005
- Center problems with pos/neg weights on treesEuropean Journal of Operational Research, 2003
- The Obnoxious Center Problem on a TreeSIAM Journal on Discrete Mathematics, 2001
- Shortest Paths in Digraphs of Small Treewidth. Part I: Sequential AlgorithmsAlgorithmica, 2000
- A linear algorithm for the pos/neg-weighted 1-median problem on a cactusComputing, 1998
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small TreewidthSIAM Journal on Computing, 1996
- The 1-Center Problem: Exploiting Block StructureTransportation Science, 1988
- Slowing down sorting networks to obtain faster sorting algorithmsJournal of the ACM, 1987
- Fractional cascading: II. ApplicationsAlgorithmica, 1986
- Fractional cascading: I. A data structuring techniqueAlgorithmica, 1986