192 search results - page 19 / 39 » A Constant-Factor Approximation Algorithm for the Multicommo... |
125
click to vote
CPM
2000
Springer
15 years 6 months ago
2000
Springer
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
135
click to vote
FOCS
2007
IEEE
15 years 8 months ago
2007
IEEE
We consider a variant of the classic multi-armed bandit problem (MAB), which we call FEEDBACK MAB, where the reward obtained by playing each of n independent arms varies according...
109
click to vote
INFOCOM
2007
IEEE
15 years 8 months ago
2007
IEEE
— Broadcast protocols play a vital role in multihop wireless networks. Due to the broadcast nature of radio signals, a node’s interference range can be larger than its transmis...
110
click to vote
FOCS
2004
IEEE
15 years 5 months ago
2004
IEEE
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...
113
click to vote
FOCS
2008
IEEE
15 years 8 months ago
2008
IEEE
We consider the read/write streams model, an extension of the standard data stream model in which an algorithm can create and manipulate multiple read/write streams in addition to...