A fast algorithm for a class of bottleneck problems (Q1916054): Difference between revisions

@@ Property / cites work @@
+Q4091421
@@ Property / cites work: Q4091421 / rank @@
+Normal rank
@@ Property / cites work @@
+Solving linear bottleneck assignment problems via strong spanning trees
+Normal rank
@@ Property / cites work @@
+The Min-Max Spanning Tree Problem and some extensions
+Normal rank
@@ Property / cites work @@
+An augmenting path method for solving linear bottleneck assignment problems
+Normal rank
@@ Property / cites work @@
+Bottleneck extrema
@@ Property / cites work: Bottleneck extrema / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for two bottleneck optimization problems
+Normal rank
@@ Property / cites work @@
+The Bottleneck Traveling Salesman Problem
@@ Property / cites work: The Bottleneck Traveling Salesman Problem / rank @@
+Normal rank
@@ Property / cites work @@
+A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf02253463
+Normal rank
@@ Property / OpenAlex ID @@
+W1559997236
@@ Property / OpenAlex ID: W1559997236 / rank @@
+Normal rank