630 search results - page 14 / 126 » Hardness results for approximating the bandwidth |
ECCC
2006
14 years 9 months ago
2006
Given a graph G and a collection of source-sink pairs in G, what is the least integer c such that each source can be connected by a path to its sink, with at most c paths going th...
COCO
2006
Springer
15 years 1 months ago
2006
Springer
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
NCA
2005
IEEE
15 years 3 months ago
2005
IEEE
The fair bandwidth allocations can isolate flows and protect well-behaved flows from ill-behaved ones. CSFQ (Core Stateless Fair Queueing) achieves the approximate fairness by d...
CPAIOR
2007
Springer
15 years 3 months ago
2007
Springer
We study the complexity of combinatorial problems that consist of competing infeasibility and optimization components. In particular, we investigate the complexity of the connectio...
JCM
2007
14 years 9 months ago
2007
—Time slot assignment is essential to provide the calculated bandwidth in a TDMA (Time Division Multiple Access)-based mobile ad hoc network (MANET), which is a focus of attentio...