The bottleneck 2-connected \(k\)-Steiner network problem for \(k \leq 2\)

DOI10.1016/j.dam.2012.01.006zbMath1243.05064arXiv1108.3655OpenAlexW2107568719WikidataQ61714616 ScholiaQ61714616MaRDI QIDQ423908

Marcus Brazil, Charl J. Ras, Doreen Anne Thomas

Publication date: 30 May 2012

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1108.3655

zbMATH Keywords

wireless networksexact algorithm2-connectedblock cut-vertex decompositionbottleneck optimisationSteiner network

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Network design and communication in computer systems (68M10) Distance in graphs (05C12)

Related Items (5)

A geometric characterisation of the quadratic min-power centre ⋮ Fixed parameter tractability of a biconnected bottleneck Steiner network problem ⋮ Survivable minimum bottleneck networks ⋮ An exact algorithm for the bottleneck 2-connected \(k\)-Steiner network problem in \(L_p\) planes ⋮ Degree bounded bottleneck spanning trees in three dimensions

Cites Work

• Unnamed Item
• Unnamed Item
• Minimum-weight two-connected spanning networks
• On exact solutions to the Euclidean bottleneck Steiner tree problem
• Guaranteed performance heuristics for the bottleneck traveling salesman problem
• Solving the Euclidean bottleneck biconnected edge subgraph problem by 2- relative neighborhood graphs
• The upper envelope of Voronoi surfaces and its applications
• A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem
• Approximations for a bottleneck Steiner tree problem
• A linear time algorithm for the bottleneck biconnected spanning subgraph problem
• Generalised \(k\)-Steiner tree problems in normed planes
• Exact Algorithms for the Bottleneck Steiner Tree Problem
• Minimax 2-connected subgraphs and the bottleneck traveling salesman problem
• Dividing a Graph into Triconnected Components
• Bottleneck Steiner trees in the plane
• Minimally 2-connected graphs.
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: The bottleneck 2-connected \(k\)-Steiner network problem for \(k \leq 2\)