Efficient algorithms for the minimum diameter bridge problem
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1256684 (Why is no real title available?)
- scientific article; zbMATH DE number 1182931 (Why is no real title available?)
- A combinatorial bound for linear programming and related problems
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Computing the optimal bridge between two polygons
- Minimax parametric optimization problems and multi-dimensional parametric searching
- On optimal bridges between two convex regions
Cited in
(8)- Computing the optimal bridge between two polygons
- Efficient systolic algorithm for finding bridges in a connected graph
- scientific article; zbMATH DE number 1786529 (Why is no real title available?)
- A cost-time trade-off Königsberg bridge problem traversing all the seven bridges allowing repetition
- Effective method for constrained minimum - reverse bridge theorem
- EXACT AND APPROXIMATION ALGORITHMS FOR FINDING AN OPTIMAL BRIDGE CONNECTING TWO SIMPLE POLYGONS
- Computing the optimal bridge between two convex polygons
- Twenty years of progress of \(\mathrm{JCDCG}^3\)
This page was built for publication: Efficient algorithms for the minimum diameter bridge problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1869735)
