On the location of a constrained \(k\)-tree facility in a tree network with unreliable edges
From MaRDI portal
Publication:2294142
DOI10.1155/2019/9520324zbMath1442.68157OpenAlexW2969917739MaRDI QIDQ2294142
Eman Fares, Abdallah W. Aboutahoun
Publication date: 10 February 2020
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2019/9520324
Programming involving graphs or networks (90C35) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Discrete location and assignment (90B80)
Cites Work
- Unnamed Item
- Unnamed Item
- A linear time algorithm for computing a most reliable source on a tree network with faulty nodes
- Algorithms for central-median paths with bounded length on trees
- Network location of a reliable center using the most reliable route policy
- Finding the \(\ell\)-core of a tree
- Optimal location of facilities on a network with an unreliable node or link
- The centdian subtree on tree networks
- On the 2-MRS problem in a tree with unreliable edges
- Reliability problems in multiple path-shaped facility location on networks
- Finding a 2-Core of a Tree in Linear Time
- Algorithms for a Core and k-Tree Core of a Tree
- On finding the core of a tree with a specified length
- The optimal location of a path or tree in a tree network
- A linear algorithm for a core of a tree
- Location of facilities on a network subject to a single‐edge failure
- A Linear Time Algorithm for Finding ak-Tree Core
- Facility Location and Reliable Route Planning in Hazardous Material Transportation
- Efficient algorithms for finding the (k,l)-core of tree networks
- Efficient Algorithms for Finding a Core of a Tree with a Specified Length
- A single facility location problem on a tree with unreliable edges
- Conditional location of path and tree shaped facilities on trees
- Efficient algorithms for a constrained k-tree core problem in a tree network
This page was built for publication: On the location of a constrained \(k\)-tree facility in a tree network with unreliable edges
