2681 search results - page 26 / 537 » Problem F |
ALGORITHMICA
2004
14 years 9 months ago
2004
We consider the Connected Facility Location problem. We are given a graph G = (V, E) with costs {ce} on the edges, a set of facilities F V , and a set of clients D V . Facility ...
STOC
2004
ACM
15 years 10 months ago
2004
ACM
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
AAIM
2009
Springer
15 years 4 months ago
2009
Springer
We develop algorithms to compute Voronoi diagrams, shortest path maps, and the Fr´echet distance in the plane with polygonal obstacles. Distances between points are measured eithe...
130
click to vote
WADS
2009
Springer
15 years 4 months ago
2009
Springer
We develop algorithms to compute edge sequences, Voronoi diagrams, shortest path maps, the Fréchet distance, and the diameter for a polyhedral surface. Distances on the surface a...
53
Voted
SIGCSE
2004
ACM
15 years 3 months ago
2004
ACM
The affective domain can be used to support the internalization of cognitive content and foster the development of curriculum and industry-related interests, attitudes, values, an...