Sciweavers

3475 search results - page 355 / 695
» Backbones in Optimization and Approximation
Sort
View
ISAAC
2005
Springer
106views Algorithms» more  ISAAC 2005»
16 years 6 days ago
Distance Labeling in Hyperbolic Graphs
A graph G is δ-hyperbolic if for any four vertices u, v, x, y of G the two larger of the three distance sums dG(u, v) + dG(x, y), dG(u, x) + dG(v, y), dG(u, y) + dG(v, x) differ b...
Cyril Gavoille, Olivier Ly
140
Voted
ESA
2004
Springer
105views Algorithms» more  ESA 2004»
16 years 2 days ago
Time Dependent Multi Scheduling of Multicast
Many network applications that need to distribute content and data to a large number of clients use a hybrid scheme in which one (or more) multicast channel is used in parallel to...
Rami Cohen, Dror Rawitz, Danny Raz
IFIP
2004
Springer
16 years 1 days ago
Solving Packing Problem with Weaker Block Solvers
We study the general packing problem with M constraints. In [Jansen and Zhang, TCS 2002] a c(1 + ε)-approximation algorithm for the general packing problem was proposed. A block s...
Hu Zhang
MICRO
2002
IEEE
159views Hardware» more  MICRO 2002»
15 years 11 months ago
Master/slave speculative parallelization
Master/Slave Speculative Parallelization (MSSP) is an execution paradigm for improving the execution rate of sequential programs by parallelizing them speculatively for execution ...
Craig B. Zilles, Gurindar S. Sohi
APPROX
2007
Springer
87views Algorithms» more  APPROX 2007»
15 years 10 months ago
Stochastic Steiner Tree with Non-uniform Inflation
We study the Steiner Tree problem in the model of two-stage stochastic optimization with non-uniform inflation factors, and give a poly-logarithmic approximation factor for this pr...
Anupam Gupta, MohammadTaghi Hajiaghayi, Amit Kumar