1414 search results - page 28 / 283 » Cover Time and Broadcast Time |
145
Voted
COMCOM
2007
15 years 5 months ago
2007
Research on video-on-demand transmissions is essentially divided into periodic broadcasting methods and on-demand methods. Periodic broadcasting is aimed to schedule transmissions...
176
click to vote
FOCS
2008
IEEE
16 years 5 days ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
167
click to vote
MDM
2004
Springer
15 years 11 months ago
2004
Springer
Data broadcasting is well known for its excellent scalability. Multi-dimensional range queries, such as spatial range queries of geographical information for location dependent se...
157
Voted
IPPS
1999
IEEE
15 years 10 months ago
1999
IEEE
This paper proposes a method for reducing the maximum degree of vertices in graphs that maintain optimal broadcast time when a vertex can call a vertex at distance at most k durin...
188
click to vote
APPROX
2005
Springer
15 years 11 months ago
2005
Springer
We study the partial vertex cover problem. Given a graph G = (V, E), a weight function w : V → R+ , and an integer s, our goal is to cover all but s edges, by picking a set of v...