Mechanism design for building optimal bridges between regions
From MaRDI portal
Publication:6636098
DOI10.1007/978-981-97-2340-9_28MaRDI QIDQ6636098FDOQ6636098
Authors: Zining Qin, Hau Chan, Chenhao Wang, Ying Zhang 
Publication date: 12 November 2024
Cites Work
- Computing the optimal bridge between two convex polygons
- Minimizing the diameter of a network using shortcut edges
- Minimizing Average Shortest Path Distances via Shortcut Edge Addition
- On computing the optimal bridge between two convex polygons.
- On optimal bridges between two convex regions
- Computing the optimal bridge between two polygons
- Facility location games with distinct desires
- Strategyproof facility location for three agents on a circle
- Approximate mechanism design for distributed facility location
- FINDING AN OPTIMAL BRIDGE BETWEEN TWO POLYGONS
This page was built for publication: Mechanism design for building optimal bridges between regions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6636098)
