Constructing Reliable Communication Networks of Small Weight Online

DOI10.1006/JAGM.1995.1005MaRDI QIDQ4327817zbMATH OpenOpenAlexFDO

Authors Barun Chandra, Sundar Vishwanathan

Publication date 9 April 1995

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

Full work available at URL https://doi.org/10.1006/jagm.1995.1005

zbMATH Keywords

complete weighted graph

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Network construction with subgraph connectivity constraints
• On-line Steiner trees in the Euclidean plane
• On an Online Spanning Tree Problem in Randomly Weighted Graphs
• The Performance of greedy algorithms for the on-line steiner tree and related problems
• A simple randomized scheme for constructing low-weight \(k\)-connected spanning subgraphs with applications to distributed algorithms

Cited in

(7)

• Not all insertion methods yield constant approximate tours in the Euclidean plane
• Constructing competitive tours from local information
• On-line generalized Steiner problem
• Network construction with subgraph connectivity constraints
• Constructing competitive tours from local information
• Network construction with ordered constraints
• On-line Steiner trees in the Euclidean plane

This page was built for publication: Constructing Reliable Communication Networks of Small Weight Online

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