3875 search results - page 212 / 775 » Approximation algorithms for the 0-extension problem |
169
click to vote
WADS
2005
Springer
15 years 11 months ago
2005
Springer
An instance of the multi-radius cover problem consists of a graph G = (V, E) with edge lengths l : E → R+ . Each vertex u ∈ V represents a transmission station for which a tra...
148
click to vote
IPL
2008
15 years 6 months ago
2008
We study the online version of the Prize-Collecting Traveling Salesman Problem (PCTSP), a generalization of the Traveling Salesman Problem (TSP). In the TSP, the salesman has to v...
155
click to vote
CONIELECOMP
2005
IEEE
15 years 11 months ago
2005
IEEE
The approximate searching problem on compressed text tries to find all the matches of a pattern in a compressed text, without decompressing it and considering that the match of th...
175
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
134
click to vote
ISAAC
2001
Springer
15 years 10 months ago
2001
Springer
We consider a problem faced by train companies: How can trains be assigned to satisfy scheduled routes in a cost efficient way? Currently, many railway companies create solutions b...