4843 search results - page 734 / 969 » The Shortcut Problem - Complexity and Approximation |
148
click to vote
SSD
2005
Springer
15 years 9 months ago
2005
Springer
Assume that a franchise plans to open k branches in a city, so that the average distance from each residential block to the closest branch is minimized. This is an instance of the ...
115
click to vote
VLDB
2005
ACM
15 years 9 months ago
2005
ACM
The largest databases in use today are so large that answering a query exactly can take minutes, hours, or even days. One way to address this problem is to make use of approximati...
127
click to vote
WADS
2005
Springer
15 years 9 months ago
2005
Springer
We study the shortest path problem in weighted polygonal subdivisions of the plane, with the additional constraint of an upper bound, k, on the number of links (segments) in the pa...
124
click to vote
CP
2004
Springer
15 years 9 months ago
2004
Springer
In CP literature combinatorial design problems such as sport scheduling, Steiner systems, error-correcting codes and more, are typically solved using Finite Domain (FD) models desp...
150
click to vote
ACSC
2003
IEEE
15 years 9 months ago
2003
IEEE
Today distributed denial of service (DDoS) attacks are causing major problems to conduct online business over the Internet. Recently several schemes have been proposed on how to p...