1388 search results - page 183 / 278 » Approximability of Robust Network Design |
INFOCOM
2006
IEEE
14 years 5 months ago
2006
IEEE
— Trade-off curves for the exact and the relaxed QoS routing problem are presented and discussed. In addition, an efficient parametric linear programming algorithm to compute th...
WINET
2002
13 years 10 months ago
2002
In wireless networks, mobile hosts must update the network with their current location in order to get packets delivered. Paging facilitates efficient power management at the mobil...
JCO
2010
13 years 9 months ago
2010
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
CCR
2007
13 years 11 months ago
2007
Rural Internet kiosks in developing regions can cost-effectively provide communication and e-governance services to the poorest sections of society. A variety of technical and no...
ICASSP
2008
IEEE
14 years 5 months ago
2008
IEEE
We consider adaptive two-channel multiple-description coding. We provide an analytical method for designing a resolutionconstrained symmetrical multiple-description coder that use...