Efficient algorithms for finding the (k,l)-core of tree networks

DOI10.1002/net.10051zbMath1026.90052OpenAlexW2060989264MaRDI QIDQ4798193

Andrea Scozzari, Giovanni Storchi, Isabella Lari, Ronald I. Becker

Publication date: 19 March 2003

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.10051

zbMATH Keywords

corefacility locationmedian subtree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Discrete location and assignment (90B80)

Related Items (4)

Extensive facility location problems on networks: an updated review ⋮ Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem ⋮ Locating tree-shaped facilities using the ordered median objective ⋮ On the location of a constrained \(k\)-tree facility in a tree network with unreliable edges

This page was built for publication: Efficient algorithms for finding the (k,l)-core of tree networks