A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem (Q1329426): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0020-0190(94)00041-7 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1999230121 / rank | |||
Normal rank |
Revision as of 19:33, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem |
scientific article |
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