909 search results - page 99 / 182 » On the approximability of some network design problems |
150
click to vote
FEWS
2007
15 years 7 months ago
2007
Many organizations face every day the problem of effectively managing their contacts (customers, suppliers, partners, etc.), in terms of communication, clustering, networking, ana...
183
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
In this paper, the problem of scalable video delivery over a timevarying wireless channel is considered. Packet scheduling and buffer management in both Application and Medium Acc...
162
click to vote
FOCS
2006
IEEE
16 years 13 days ago
2006
IEEE
d abstract] Robert Krauthgamer ∗ IBM Almaden James R. Lee † Institute for Advanced Study We initiate the study of approximate algorithms on negatively curved spaces. These spa...
196
click to vote
FOCS
1995
IEEE
15 years 10 months ago
1995
IEEE
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...
170
click to vote
BIRD
2008
Springer
15 years 8 months ago
2008
Springer
Finding motifs in biological sequences is one of the most intriguing problems for string algorithms designers due to, on the one hand, the numerous applications of this problem in...