The 1-Center Problem: Exploiting Block Structure

DOI10.1287/TRSC.22.4.259MaRDI QIDQ3818093zbMATH OpenOpenAlexFDO

Authors

Publication date 1988

Published in Transportation Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/trsc.22.4.259

zbMATH Keywords

block of a graphblocking graphmaximal nonseparable subgraphnonlinear 1-center problem on graphstree

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05) Programming involving graphs or networks (90C35)

Recommendations

• Block-vertex duality and the one-median problem
• An unweighted 1-center problem on block graphs
• scientific article; zbMATH DE number 4095237
• The \(p\)-maxian problem on block graphs
• The connected p-center problem on block graphs with forbidden vertices

Cited in

(10)

• Locating an absolute center on graphs that are almost trees
• Efficient algorithms for center problems in cactus networks
• An unweighted 1-center problem on block graphs
• Graph centers used for stabilization of matrix factorizations
• scientific article; zbMATH DE number 3968630 (Why is no real title available?)
• Block-vertex duality and the one-median problem
• The backup 2-median problem on block graphs
• Discrete center problems
• The \(p\)-maxian problem on block graphs
• A minimum length covering subgraph of a network

This page was built for publication: The 1-Center Problem: Exploiting Block Structure

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3818093)