„Approximation Algorithm“

Suchergebnisse

2.890 Treffer

• 10071 Abstracts Collection – Scheduling
  Albers, Susanne ; Baruah, Sanjoy K. ; Möhring, Rolf H. ; Pruhs, Kirk
• Differentially Private Combinatorial Optimization
  Talwar, Kunal ; Gupta, Anupam ; Ligett, Katrina ; McSherry, Frank ; Roth, Aaron
• 09511 Open Problems – Parameterized complexity and approximation algorithms
  Demaine, Erik D. ; Hajiaghayi, MohammadTaghi ; Marx, Dániel
• 09511 Executive Summary – Parameterized complexity and approximation algorithms
  Demaine, Erik D. ; Hajiaghayi, MohammadTaghi ; Marx, Dániel
• 09511 Abstracts Collection – Parameterized complexity and approximation algorithms
  Demaine, Erik D. ; Hajiaghayi, MohammadTaghi ; Marx, Dániel
• Deterministic approximation algorithms for the nearest codeword problem
  Alon, Noga ; Panigrahy, Rina ; Yekhanin, Sergey
• 09391 Abstracts Collection – Algorithms and Complexity for Continuous Problems
  Müller-Gronbach, Thomas ; Plaskota, Leszek ; Traub, Joseph F.
• Sharing Supermodular Costs
  Schulz, Andreas S. ; Uhan, Nelson A.
• A Robust PTAS for the Parallel Machine Covering Problem
  Skutella, Martin ; Verschae, Jose
• Assessing an approximation algorithm for the minimum fill-in problem in practice
  Bücker, H. Martin ; Lülfesmann, Michael ; Rasch, Arno
• Statistical Tests for Key Recovery Using Multidimensional Extension of Matsui's Algorithm 1
  Hermelin, Miia ; Cho, Joo Yeon ; Nyberg, Kaisa
• 08492 Executive Summary – Structured Decompositions and Efficient Algorithms
  Dahlke, Stephan ; Daubechies, Ingrid ; Elad, Michael ; Kutyniok, Gitta ; Teschke, Gerd
• 08341 Abstracts Collection – Sublinear Algorithms
  Czumaj, Artur ; Muthukrishnan, S. Muthu ; Rubinfeld, Ronitt ; Sohler, Christian
• A Space-Saving Approximation Algorithm for Grammar-Based Compression
  Sakamoto, Hiroshi
• Near-Linear Time and Fixed-Parameter Tractable Algorithms for Tensor Decompositions
  Mahankali, Arvind V. ; Woodruff, David P. ; Zhang, Ziyu 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• FPT Approximation for Capacitated Sum of Radii
  Jaiswal, Ragesh ; Kumar, Amit ; Yadav, Jatin 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Exponential-Time Approximation Schemes via Compression
  Inamdar, Tanmay ; Kundu, Madhumita ; Parviainen, Pekka ; Ramanujan, M. S. ; Saurabh, Saket 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The Message Complexity of Distributed Graph Optimization
  Dufoulon, Fabien ; Pai, Shreyas ; Pandurangan, Gopal ; Pemmaraju, Sriram V. ; Robinson, Peter 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Simple and Optimal Online Contention Resolution Schemes for k-Uniform Matroids
  Dinev, Atanas ; Weinberg, S. Matthew 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Sublinear Approximation Algorithm for Nash Social Welfare with XOS Valuations
  Barman, Siddharth ; Krishna, Anand ; Kulkarni, Pooja ; Narang, Shivika 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik