Four results on randomized incremental constructions
Computational Geometry: Theory and Applications
SIAM Journal on Computing
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Finding the k Smallest Spanning Trees
SWAT '90 Proceedings of the 2nd Scandinavian Workshop on Algorithm Theory
Pareto Shortest Paths is Often Feasible in Practice
WAE '01 Proceedings of the 5th International Workshop on Algorithm Engineering
A survey of geodesic paths on 3D surfaces
Computational Geometry: Theory and Applications
Hi-index | 0.00 |
We present a generic package for resource constrained network optimization problems. We illustrate the flexibility and the use of our package by solving four applications: route planning, curve approximation, minimum cost reliability constrained spanning trees and the table layout problem.