15254 search results - page 315 / 3051 » A k |
210
Voted
TAMC
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Given an undirected graph G and an integer k ≥ 0, the NPhard 2-Layer Planarization problem asks whether G can be transformed into a forest of caterpillar trees by remov...
204
click to vote
FOCS
2006
IEEE
16 years 1 months ago
2006
IEEE
An additive spanner of an unweighted undirected graph G with distortion d is a subgraph H such that for any two vertices u, v ∈ G, we have δH(u, v) ≤ δG(u, v) + d. For every...
184
Voted
DCC
2008
IEEE
16 years 7 months ago
2008
IEEE
Symmetric multilevel diversity coding was introduced by Roche et al, where a set of K information sources is encoded by K encoders and the decoders reconstruct sources 1, . . . , ...
222
Voted
APPROX
2009
Springer
16 years 2 months ago
2009
Springer
Submodular-function maximization is a central problem in combinatorial optimization, generalizing many important NP-hard problems including Max Cut in digraphs, graphs and hypergr...
176
Voted
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
— In this paper, we consider a source rate control scheme for a finite buffer of size C in a medium access control layer of a wireless system over a Markovian channel. Our rate ...