14158 search results - page 323 / 2832 » Generalized switch-setting problems |
137
click to vote
APPROX
2010
Springer
15 years 6 months ago
2010
Springer
We consider two natural generalizations of the Asymmetric Traveling Salesman problem: the k-Stroll and the k-Tour problems. The input to the k-Stroll problem is a directed n-verte...
137
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
The stable marriage problem is a well-known problem of matching men to women so that no man and woman, who are not married to each other, both prefer each other. Such a problem ha...
154
click to vote
SIAMCOMP
2008
15 years 4 months ago
2008
We develop approximation algorithms for the problem of placing replicated data in arbitrary networks, where the nodes may both issue requests for data objects and have capacity fo...
147
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
We examine several online matching problems, with applications to Internet advertising reservation systems. Consider an edge-weighted bipartite graph G, with partite sets L, R. We...
114
click to vote
CPM
2004
Springer
15 years 10 months ago
2004
Springer
Given a set S = {s1, s2, . . . , sn} of strings each of length m, and an integer L, we study the following two problems. k-Closest Substring problem: find k center strings c1, c2,...