„Approximation Algorithm“

Suchergebnisse

2.890 Treffer

• 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
• Approximating Connected Facility Location with Lower and Upper Bounds via LP Rounding
  Friggstad, Zachary ; Rezapour, Mohsen ; Salavatipour, Mohammad R. 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• 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
• Ad-hoc, mobile, and wireless networks – 11th international conference ; proceedings
  Li, XiangYang ; Papavassiliou, Symeon ; Ruehrup, Stefan 2012 Springer
• 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
• Exact and Approximation Algorithms for Routing a Convoy Through a Graph
  Ee, Martijn ˜vanœ ; Oosterwijk, Tim ; Sitters, René ; Wiese, Andreas 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The Ground-Set-Cost Budgeted Maximum Coverage Problem
  van Heuven van Staereling, Irving ; Keijzer, Bart ˜deœ ; Schäfer, Guido 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Exact and Approximation Algorithms for Many-To-Many Point Matching in the Plane
  Bandyapadhyay, Sayan ; Maheshwari, Anil ; Smid, Michiel 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Fixed-Parameter Algorithms for Unsplittable Flow Cover
  Cristi, Andrés ; Mari, Mathieu ; Wiese, Andreas 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Smallest k-Enclosing Rectangle Revisited
  Chan, Timothy M. ; Har-Peled, Sariel 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Van Hoorn, M.H.: Algorithms and approximations for queueing systems. CWITracts8, Centrum voor Wiskunde en Informatica, Amsterdam 1984, VII, 122 S., Dfl. 17.90
  Stoyan, D.
• On Approximation Schemes for Stabbing Rectilinear Polygons
  Khan, Arindam ; Subramanian, Aditya ; Widmann, Tobias ; Wiese, Andreas 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik