Sciweavers

3096 search results - page 27 / 620
» The Generalized FITC Approximation
Sort
View
MOR
2000
162views more  MOR 2000»
13 years 8 months ago
Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems
Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...
Alok Baveja, Aravind Srinivasan
QUESTA
2007
91views more  QUESTA 2007»
13 years 8 months ago
Iterative approximation of k -limited polling systems
The present paper deals with the problem of calculating queue length distributions in a polling model with (exhaustive) k-limited service under the assumption of general arrival, ...
M. van Vuuren, Erik M. M. Winands
APPML
2011
13 years 3 months ago
On Taylor/Eddy solutions of approximate deconvolution models of turbulence
This article shows that, so called, general Green-Taylor solutions, also called Taylor solutions or eddy solutions of the 2d Navier Stokes equations are also exact solutions to app...
William J. Layton
INFOCOM
2010
IEEE
13 years 7 months ago
Approximate Capacity Subregions of Uniform Multihop Wireless Networks
—The capacity region of multihop wireless network is involved in many capacity optimization problems. However, the membership of the capacity region is NP-complete in general, an...
Peng-Jun Wan, Lixin Wang, Ai Huang, Minming Li, F....
WAOA
2010
Springer
209views Algorithms» more  WAOA 2010»
13 years 6 months ago
Densest k-Subgraph Approximation on Intersection Graphs
We study approximation solutions for the densest k-subgraph problem (DS-k) on several classes of intersection graphs. We adopt the concept of -quasi elimination orders, introduced ...
Danny Z. Chen, Rudolf Fleischer, Jian Li