Algorithms for a Core and k-Tree Core of a Tree

DOI10.1006/jagm.1993.1034zbMath0782.68092OpenAlexW2092866803MaRDI QIDQ3141526

Shietung Peng, A. B. Stephens, Yelena Yesha

Publication date: 13 March 1994

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.1993.1034

zbMATH Keywords

minimization problemresource allocationdistributed databasetree networkcore of a tree

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (15)

Optimal allocation for partially replicated database systems on tree- based networks ⋮ Extensive facility location problems on networks: an updated review ⋮ On the finding 2-(k,l)-core of a tree with arbitrary real weight ⋮ Finding cores of limited length ⋮ Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem ⋮ Locating median paths on connected outerplanar graphs ⋮ The path-variance problem on tree networks ⋮ Locating tree-shaped facilities using the ordered median objective ⋮ The continuous and discrete path‐variance problems on trees ⋮ On the location of a constrained \(k\)-tree facility in a tree network with unreliable edges ⋮ Distributed algorithms for finding and maintaining a \(k\)-tree core in a dynamic network ⋮ A review of extensive facility location in networks ⋮ Minimax regret path location on trees ⋮ Efficient algorithms to solve the link-orientation problem for multi-square, convex-bipartite, and convex-split networks ⋮ The centdian subtree on tree networks

This page was built for publication: Algorithms for a Core and k-Tree Core of a Tree