6 citations · 6 across the 1 of their papers we have counts for
2 papers
cs.DM2003★ 6 cited
Sharp Bounds for Bandwidth of Clique Products
Tanya Y. Berger-Wolf, Mitchell A. Harris
The bandwidth of a graph is the labeling of vertices with minimum maximum edge difference. For many graph families this is NP-complete. A classic result computes the bandwidth for…
cs.DS2000
Index Assignment for Multichannel Communication under Failure
Tanya Y. Berger-Wolf, Edward M. Reingold
We consider the problem of multiple description scalar quantizers and describing the achievable rate-distortion tuples in that setting. We formulate it as a combinatorial optimizat…