Minimax 2-connected subgraphs and the bottleneck traveling salesman problem

DOI10.1007/BF01068903zbMath0467.05043MaRDI QIDQ3919743

No author found.

Publication date: 1979

Published in: Cybernetics (Search for Journal in Brave)

zbMATH Keywords

spanning treeHamilton cyclesminimax subgraph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Operations research and management science (90B99) Connectivity (05C40) Algorithms in computer science (68W99)

Related Items (2)

The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis ⋮ The bottleneck 2-connected \(k\)-Steiner network problem for \(k \leq 2\)

Cites Work

• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
• A SOLVABLE CASE OF THE TRAVELING SALESMAN PROBLEM

This page was built for publication: Minimax 2-connected subgraphs and the bottleneck traveling salesman problem