Sciweavers

2714 search results - page 150 / 543
» Approximation Schemes for Scheduling
Sort
View
109
Voted
CCCG
2007
15 years 2 months ago
Approximating k-hop Minimum Spanning Trees in Euclidean Metrics
In the minimum-cost k-hop spanning tree (k-hop MST) problem, we are given a set S of n points in a metric space, a positive small integer k and a root point r ∈ S. We are intere...
Sören Laue, Domagoj Matijevic
96
Voted
ESA
2010
Springer
227views Algorithms» more  ESA 2010»
15 years 1 months ago
Approximating Parameterized Convex Optimization Problems
We consider parameterized convex optimization problems over the unit simplex, that depend on one parameter. We provide a simple and efficient scheme for maintaining an -approximat...
Joachim Giesen, Martin Jaggi, Sören Laue
NOSSDAV
2001
Springer
15 years 5 months ago
The utility of feedback in layered multicast congestion control
Layered multicast is a common approach for dissemination of audio and video in heterogeneous network environments. Layered multicast schemes can be classified into two categories...
Sergey Gorinsky, Harrick M. Vin
ENTCS
2008
91views more  ENTCS 2008»
15 years 25 days ago
Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra
Several different uses of Newton's method in connection with the Fundamental Theorem of Algebra are pointed out. Theoretical subdivision schemes have been combined with the n...
Prashant Batra
MOC
2010
14 years 7 months ago
Approximation of nonlinear wave equations with nonstandard anisotropic growth conditions
Weak solutions for nonlinear wave equations involving the p(x)-Laplacian, for p : (1, ) are constructed as appropriate limits of solutions of an implicit finite element discretiz...
Jonas Haehnle, Andreas Prohl