Finding the \(\ell\)-core of a tree
From MaRDI portal
Publication:1348250
DOI10.1016/S0166-218X(01)00254-2zbMath1004.68123MaRDI QIDQ1348250
Giovanni Storchi, Yen I. Chang, Ronald I. Becker, Isabella Lari, Andrea Scozzari
Publication date: 15 May 2002
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Related Items (12)
Algorithms for central-median paths with bounded length on trees ⋮ Extensive facility location problems on networks: an updated review ⋮ Finding a core of a tree with pos/neg weight ⋮ Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem ⋮ Comparing different metaheuristic approaches for the median path problem with bounded length ⋮ Finding an optimal core on a tree network with M/G/c/c state-dependent queues ⋮ Locating median paths on connected outerplanar graphs ⋮ The location of median paths on grid graphs ⋮ A linear time algorithm for finding an optimal degree-bounded subtree of an edge-weighted tree ⋮ Core and Conditional Core Path of Specified Length in Special Classes of Graphs ⋮ On the location of a constrained \(k\)-tree facility in a tree network with unreliable edges ⋮ An algorithm for solving the bi-objective median path-shaped facility on a tree network
Cites Work
- An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs
- On locating path- or tree-shaped facilities on networks
- Optimal location of a path or tree on a network with cycles
- INDUCTIVE ALGORITHMS ON FINITE TREES
- The optimal location of a path or tree in a tree network
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- A linear algorithm for a core of a tree
- Efficient Algorithms for Finding a Core of a Tree with a Specified Length
- Unnamed Item
This page was built for publication: Finding the \(\ell\)-core of a tree
