„Approximation Algorithm“

Suchergebnisse

2.890 Treffer

• Building Clusters with Lower-Bounded Sizes
  Abu-Khzam, Faisal ; Bazgan, Cristina ; Casel, Katrin ; Fernau, Henning 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Priori Convergence Theory for Reduced-Basis Approximations of Single-Parameter Elliptic Partial Differential Equations
  Maday, Yvon ; Patera, Anthony T. ; Turinici, Gabriel
• A $$(1.4 + \epsilon )$$ ( 1.4 + ϵ ) -approximation algorithm for the 2-Max-Duo problem
  Chen, Yong ; Lin, Guohui ; Liu, Tian ; Luo, Taibo ; Su, Bing ; Xu, Yao ; Zhang, Peng
• Multi-Level Weighted Additive Spanners
  Ahmed, Reyan ; Bodwin, Greg ; Sahneh, Faryad Darabi ; Hamm, Keaton ; Kobourov, Stephen ; Spence, Richard 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness
  Fleszar, Krzysztof ; Mnich, Matthias ; Spoerhase, Joachim 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• First Fit bin packing: A tight analysis
  Dósa, György ; Sgall, Jiří 2013 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• An approximation algorithm for stochastic multi-level facility location problem with soft capacities
  Wu, Chenchen ; Du, Donglei ; Kang, Yue
• Region-Based Approximation of Probability Distributions (for Visibility Between Imprecise Points Among Obstacles)
  Buchin, Kevin ; Kostitsyna, Irina ; Löffler, Maarten ; Silveira, Rodrigo I.
• Information-theoretic approximations of the nonnegative rank
  Braun, Gábor ; Jain, Rahul ; Lee, Troy ; Pokutta, Sebastian
• Approximation Algorithms for Capacitated Location Routing
  Harks, Tobias ; König, Felix G. ; Matuschke, Jannik
• Approximation from shift-invariant spaces with smooth generators
  Selvan, A. Antony ; Bhandari, Ayush ; Radha, R.
• A (1.4 + epsilon)-Approximation Algorithm for the 2-Max-Duo Problem
  Xu, Yao ; Chen, Yong ; Lin, Guohui ; Liu, Tian ; Luo, Taibo ; Zhang, Peng 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Anchored Rectangle and Square Packings
  Balas, Kevin ; Dumitrescu, Adrian ; Tóth, Csaba D. 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Stochastic and Robust Scheduling in the Cloud
  Chen, Lin ; Megow, Nicole ; Rischke, Roman ; Stougie, Leen 2015 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Minimizing Flow Time in the Wireless Gathering Problem
  Bonifaci, Vincenzo ; Korteweg, Peter ; Marchetti-Spaccamela, Alberto ; Stougie, Leen 2008 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Approximation algorithms for solving the trip-constrained vehicle routing cover problems
  Li, Jianping ; Yang, Ping ; Lichen, Junran ; Pan, Pengxiang
• Practical Sketching Algorithms for Low-Rank Tucker Approximation of Large Tensors
  Dong, Wandi ; Yu, Gaohang ; Qi, Liqun ; Cai, Xiaohao
• An approximation algorithm for genome sorting by reversals to recover all adjacencies
  Zhai, Shanshan ; Zhang, Peng ; Zhu, Daming ; Tong, Weitian ; Xu, Yao ; Lin, Guohui
• Guarding Orthogonal Art Galleries with Sliding k-Transmitters: Hardness and Approximation
  Biedl, Therese ; Chan, Timothy M. ; Lee, Stephanie ; Mehrabi, Saeed ; Montecchiani, Fabrizio ; Vosoughpour, Hamideh ; Yu, Ziting
• A Constant Approximation Algorithm for Scheduling Packets on Line Networks
  Even, Guy ; Medina, Moti ; Rosén, Adi 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik