75 search results - page 5 / 15 » Triangle Fixing Algorithms for the Metric Nearness Problem |
FOCS
2008
IEEE
14 years 3 months ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
SODA
1992
ACM
13 years 9 months ago
1992
ACM
Given a set P of n points in the plane, we wish to find a set Q P of k points for which the convex hull conv(Q) has the minimum area. We solve this, and the related problem of fi...
APPROX
2005
Springer
14 years 2 months ago
2005
Springer
Traditionally, a fundamental assumption in evaluating the performance of algorithms for sorting and selection has been that comparing any two elements costs one unit (of time, work...
ICGA
1993
13 years 10 months ago
1993
A genetic algorithms is applied to find a maximum flow from the source to sink in a weighted directed graph, where the weight associated with each edge represents its flow capacit...
TOG
2008
13 years 8 months ago
2008
We introduce a simplification algorithm for meshes composed of quadrilateral elements. It is reminiscent of edge-collapse based methods for triangle meshes, but takes a novel appr...