Upgrading trees under diameter and budget constraints

DOI10.1002/NET.10055MaRDI QIDQ4797944zbMATH OpenOpenAlexFDO

Authors Victor Chepoi, Yann Vaxès, Hartmut Noltemeier

Publication date 10 March 2003

Published in Networks (Search for Journal in Brave)

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

zbMATH Keywords

treesdiameternetwork designcutsfacility location problemsnetwork upgrade

Mathematics Subject Classification ID

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

Recommendations

• Lowering eccentricity of a tree by node upgrading
• Almost optimal algorithms for diameter-optimally augmenting trees
• Improving Minimum Cost Spanning Trees by Upgrading Nodes
• Fast algorithms for diameter-optimally augmenting paths and trees
• Up- and downgrading the 1-center in a network

Cites work

• Modifying edges of a network to obtain short subgraphs
• State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems

Cited in

(7)

• Optimizing budget allocation for center and median points
• Optimal approaches for upgrading selective obnoxious \(p\)-median location problems on tree networks
• On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph
• Lowering eccentricity of a tree by node upgrading
• Algorithms and Computation
• Up- and downgrading the 1-center in a network
• Maintenance cost, toppling risk and size of trees in a self-thinning stand

This page was built for publication: Upgrading trees under diameter and budget constraints

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