Greedy algorithms for the on-line steiner tree and generalized steiner problems
- 1 January 1993
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Competitive distributed file allocationPublished by Association for Computing Machinery (ACM) ,1993
- On-line Steiner trees in the Euclidean planePublished by Association for Computing Machinery (ACM) ,1992
- Competitive algorithms for distributed data management (extended abstract)Published by Association for Computing Machinery (ACM) ,1992
- Dynamic Steiner Tree ProblemSIAM Journal on Discrete Mathematics, 1991
- The multicast policy and its relationship to replicated data placementACM Transactions on Database Systems, 1991
- When trees collidePublished by Association for Computing Machinery (ACM) ,1991
- On the power of randomization in online algorithmsPublished by Association for Computing Machinery (ACM) ,1990
- Steiner problem in networks: A surveyNetworks, 1987
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- On Steiner’s Problem with Rectilinear DistanceSIAM Journal on Applied Mathematics, 1966