Efficient algorithms for a constrained k-tree core problem in a tree network

DOI10.1016/j.jalgor.2004.12.002zbMath1103.68135OpenAlexW2001395951MaRDI QIDQ5478009

Shan-Chyun Ku, Biing-Feng Wang, Shietung Peng, Hong-Yi Yu

Publication date: 30 June 2006

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

Full work available at URL: https://doi.org/10.1016/j.jalgor.2004.12.002

zbMATH Keywords

algorithmstreescentersdiameterscores

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Database theory (68P15) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

Extensive facility location problems on networks: an updated review ⋮ Efficient algorithms for two generalized 2-median problems and the group median problem on trees ⋮ 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 a constrained k-tree core problem in a tree network