Average sensitivity of geometric algorithms
From MaRDI portal
Cites work
- A combinatorial theorem in plane geometry
- A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
- Average sensitivity of dynamic programming
- Average Sensitivity of Graph Algorithms
- Average sensitivity of the knapsack problem
- Computational geometry. Algorithms and applications.
- scientific article; zbMATH DE number 4065813 (Why is no real title available?)
- Lipschitz continuous algorithms for graph problems
- Local Graph Partitions for Approximation and Testing
- On the upper-bound conjecture for convex polytopes
- Random walks and forbidden minors iii: poly-time partition oracles for minor-free graph classes
- Triangulating a simple polygon
- Triangulating Simple Polygons and Equivalent Problems
This page was built for publication: Average sensitivity of geometric algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7445575)