„approximation algorithms“

Suchergebnisse

2.086 Treffer

• A note: approximation algorithms for batch scheduling on shops with job rejection
  Mosheiov, Gur ; Sarig, Assaf
• Efficient Approximation Quality Computation for Sandwiching Algorithms for Convex Multicriteria Optimization
  Lammel, Ina ; Küfer, Karl-Heinz ; Süss, Philipp
• Quasi-Polynomial Time Algorithms for Free Quantum Games in Bounded Dimension
  Jee, Hyejung H. ; Sparaciari, Carlo ; Fawzi, Omar ; Berta, Mario 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness
  Nadara, Wojciech ; Pilipczuk, Marcin ; Rabinovich, Roman ; Reidl, Felix ; Siebertz, Sebastian 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The Price of Optimum: Complexity and Approximation for a Matching Game
  Escoffier, Bruno ; Gourvès, Laurent ; Monnot, Jérôme
• Algorithms and computation – 6th international workshop ; proceedings
  Rahman, Md. Saidur ; Nakano, Shin-ichi 2012 Springer
• A Fast 3-Approximation for the Capacitated Tree Cover Problem with Edge Loads
  Rockel, Benjamin Marc 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Relational Algorithms for k-Means Clustering
  Moseley, Benjamin ; Pruhs, Kirk ; Samadian, Alireza ; Wang, Yuyan 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Algorithms for Low-Distortion Embeddings into Arbitrary 1-Dimensional Spaces
  Carpenter, Timothy ; Fomin, Fedor V. ; Lokshtanov, Daniel ; Saurabh, Saket ; Sidiropoulos, Anastasios 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Transactions on Large-Scale Data- and Knowledge-Centered Systems XXIX
  Hameurlain, Abdelkader ; Küng, Josef ; Wagner, Roland 2016 Springer Berlin Heidelberg
• Approximation Algorithms for Union and Intersection Covering Problems
  Cygan, Marek ; Grandoni, Fabrizio ; Leonardi, Stefano ; Mucha, Marcin ; Pilipczuk, Marcin ; Sankowski, Piotr 2011 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A (2 + ε)-Factor Approximation Algorithm for Split Vertex Deletion
  Lokshtanov, Daniel ; Misra, Pranabendu ; Panolan, Fahad ; Philip, Geevarghese ; Saurabh, Saket 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Tilt Assembly: Algorithms for Micro-Factories that Build Objects with Uniform External Forces
  Becker, Aaron T. ; Fekete, Sándor ; Keldenich, Phillip ; Krupke, Dominik ; Rieck, Christian ; Scheffer, Christian ; Schmidt, Arne 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Verification of Derandomized Probabilistic Algorithms
  Karayel, Muhammed Emin ; Nipkow, Tobias ; Thiemann, René ; Kiam, Tan Yong 2025 Universitätsbibliothek der TU München
• Approximation and Parameterized Algorithms for Scheduling Problems
  Fischer, David Simon ; Jansen, Klaus ; Verschae, José 2025 Universitätsbibliothek Kiel
• Automata, languages, and programming – 41st international colloquium ; proceedings
  Esparza, Javier ; Fraigniaud, Pierre ; Husfeldt, Thore ; Koutsoupias, Elias Springer
• Transactions on Large-Scale Data- and Knowledge-Centered Systems XXVI – Special Issue on Data Warehousing and Knowledge Discovery
  Hameurlain, Abdelkader ; Küng, Josef ; Wagner, Roland ; Bellatreche, Ladjel ; Mohania, Mukesh 2016 Springer International Publishing
• Vehicle Routing in Theory and Practice
  Blauth, Jannis ; Vygen, Jens ; Traub, Vera 2024 Universitäts- und Landesbibliothek Bonn
• Approximating (\(\kappa\),ℓ)-median clustering for polygonal curves
  Buchin, Maike ; Driemel, Anne ; Rohde, Dennis 2023 Ruhr-Universität Bochum
• Automata, Languages, and Programming – 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part II
  Esparza, Javier ; Fraigniaud, Pierre ; Husfeldt, Thore ; Koutsoupias, Elias 2014 Springer Berlin Heidelberg