„Approximation Algorithms“

Suchergebnisse

2.086 Treffer

• Provably good approximation algorithms for optimal kinodynamic planning for Cartesian robots and open-chain manipulators
  Donald, B. R. ; Xavier, P. G.
• Provably good approximation algorithms for optimal kinodynamic planning: Robots with decoupled dynamics bounds
  Donald, B. R. ; Xavier, P.
• Approximation algorithms for scheduling unrelated parallel machines
  Lenstra, Jan K. ; Shmoys, David B. ; Tardos, Éva
• Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
  Hochbaum, Dorit S. ; Megiddo, Nimrod ; Naor, Joseph (Seffi) ; Tamir, Arie
• Approximation algorithms for two-machine flow shop scheduling with batch setup times
  Chen, Bo ; Potts, Chris N. ; Strusevich, Vitaly A.
• An only 2-step Q-superlinear convergence example for some algorithms that use reduced hessian approximations
  Yuan, Y.
• Fast and stable rational approximation of generalized hypergeometric functions
  Slevinsky, Richard Mikaël
• Approximation algorithms for indefinite quadratic programming
  Vavasis, Stephen A.
• Low-reynolds number approximation for turbulent eddy viscosity
  Yakhot, A. ; Rakib, S. ; Flannery, W. S.
• Approximation Algorithms for the MAXSPACE Advertisement Problem
  Pedrosa, Lehilton Lelis Chaves ; da Silva, Mauro R. C. ; Schouery, Rafael C. S.
• Derivative free analogues of the Levenberg-Marquardt and Gauss algorithms for nonlinear least squares approximation
  Brown, Kenneth M. ; Dennis, J. E.
• Multilevel scattered data approximation by adaptive domain decomposition
  Iske, Armin ; Levesley, Jeremy
• The parallel complexity of approximation algorithms for the maximum acyclic subgraph problem
  Greenlaw, Raymond
• Algorithms for computing shape preserving spline approximations to data
  Dodd, S. L. ; McAllister, D. F.
• Improved Approximation Algorithms for the Quality of Service Multicast Tree Problem
  Karpinski, Marek ; Mandoiu, Ion I. ; Olshevsky, Alexander ; Zelikovsky, Alexander
• Approximation Algorithms with Constant Factors for a Series of Asymmetric Routing Problems
  Neznakhina, E. D. ; Ogorodnikov, Yu. Yu ; Rizhenko, K. V. ; Khachay, M. Yu
• Approximation algorithms for the fault-tolerant facility location problem with submodular penalties
  Guo, Yingying ; Li, Qiaoliang
• Non-asymptotic confidence bounds for stochastic approximation algorithms with constant step size
  Pflug, Georg Ch
• Comments on “Fractal functions associated with Reich contractions: an approximation of chaotic attractors”
  Prithvi, B. V. ; Katiyar, S. K.
• Fast approximation algorithms for Steiner's problem in graphs
  Widmayer, Peter