A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem (Q1329426)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem |
scientific article; zbMATH DE number 600101
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem |
scientific article; zbMATH DE number 600101 |
Statements
A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem (English)
0 references
12 June 1995
0 references
This paper gives an algorithm, that solves in \(O(| E | + | V | \log | V |)\) time the following problems: given a graph \(G = (V,E)\) with a weight for each edge, find a biconnected spanning subgraph whose maximum edge weight is as small as possible. This problem arises, amongst others, in approximation algorithms for the bottleneck TSP problem.
0 references
biconnectivity
0 references
biconnected spanning subgraph
0 references
approximation algorithms
0 references
bottleneck TSP problem
0 references
0 references
