233 search results - page 46 / 47 » Flows on Few Paths: Algorithms and Lower Bounds |
SPAA
1999
ACM
13 years 12 months ago
1999
ACM
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
ICALP
2011
Springer
12 years 11 months ago
2011
Springer
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...
INFOCOM
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract— Simulation has been the dominant research methodology in wireless and sensor networking. When mobility is added, real-world experimentation is especially rare. However,...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract— We consider the approximate sparse recovery problem, where the goal is to (approximately) recover a highdimensional vector x ∈ Rn from its lower-dimensional sketch Ax...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
This paper describes and analyzes sporadic model building, which can be used to enhance the efficiency of the hierarchical Bayesian optimization algorithm (hBOA) and other advance...