„approximation algorithms“

Suchergebnisse

2.086 Treffer

• Efficient approximation and privacy preservation algorithms for real time online evolving data streams
  Patil, Rahul A. ; Patil, Pramod D.
• Aggregation of demand-side flexibilities: A comparative study of approximation algorithms
  Öztürk, Emrah ; Rheinberger, Klaus ; Faulwasser, Timm ; Worthmann, Karl ; Preißinger, Markus 2022 Technische Universität Hamburg. Universitätsbibliothek
• Approximation algorithms for stochastic online matching with reusable resources
  Shanks, Meghan ; Yu, Ge ; Jacobson, Sheldon H.
• Improved approximation algorithms for some min–max postmen cover problems with applications to the min–max subtree cover
  Wei, Yu
• Approximation algorithms for scheduling monotonic moldable tasks on multiple platforms
  Wu, Fangfang ; Jiang, Zhongyi ; Zhang, Run ; Zhang, Xiandong
• Approximation algorithms for batch scheduling with processing set restrictions
  Chai, Xing ; Li, Wenhua ; Ng, C. T. ; Cheng, T. C. E.
• Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem
  Skutella, Martin
• Approximation Algorithms
  Schulz, Andreas S. ; Shmoys, David Bernard ; Williamson, David P.
• Greedy algorithms for image approximation from scattered Radon data
  Albrecht, Kristof ; Iske, Armin
• Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups and job rejection
  Ou, Jinwen
• Approximation algorithms for the twin robot scheduling problem
  Jaehn, Florian ; Wiehl, Andreas
• Two-stage open-shop scheduling with a two-machine flow shop as a stage: approximation algorithms and empirical experiments
  Dong, Jianming ; Chang, Joshua ; Su, Bing ; Hu, Jueliang ; Lin, Guohui
• Stochastic model checking – rigorous dependability analysis using model checking techniques for stochastic systems ; international autumn school ; advanced lectures
  Remke, Anne ; Stoelinga, Mariëlle 2014 Springer
• Sublinear Time Eigenvalue Approximation via Random Sampling
  Bhattacharjee, Rajarshi ; Dexter, Gregory ; Drineas, Petros ; Musco, Cameron ; Ray, Archan
• Approximation algorithms for the restricted k-Chinese postman problems with penalties
  Pan, Pengxiang ; Zhu, Hongtao
• Approximations for Throughput Maximization
  Hyatt-Denesik, Dylan ; Rahgoshay, Mirmahdi ; Salavatipour, Mohammad R.
• Good code design with combinatorial approximation algorithms
  Koschnick, Klaus-Uwe 1991 Sonderforschungsbereich 343
• Parallel comparison algorithms for approximation problems
  Alon, N. ; Azar, Y.
• An 11/6-approximation algorithm for the network steiner problem
  Zelikovsky, A. Z.
• The hardness of approximation: Gap location
  Petrank, Erez