„algorithm design“

Suchergebnisse

6.264 Treffer

• Data-Driven Solution Portfolios
  Drygala, Marina ; Lattanzi, Silvio ; Maggiori, Andreas ; Stouras, Miltiadis ; Svensson, Ola ; Vassilvitskii, Sergei 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Fast, Fair and Truthful Distributed Stable Matching for Common Preferences
  Hirvonen, Juho ; Ranjbaran, Sara 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• FREIGHT: Fast Streaming Hypergraph Partitioning
  Eyubov, Kamal ; Fonseca Faraj, Marcelo ; Schulz, Christian
• The Time Complexity of Consensus Under Oblivious Message Adversaries
  Winkler, Kyrill ; Paz, Ami ; Rincón Galeana, Hugo ; Schmid, Stefan ; Schmid, Ulrich
• Quantum Software Engineering (Dagstuhl Seminar 24512)
  Ali, Shaukat ; Barzen, Johanna ; Delgado, Andrea ; Müller, Hausi A. ; Murillo, Juan Manuel
• Fair Division: Algorithms, Solution Concepts, and Applications (Dagstuhl Seminar 24401)
  Markakis, Evangelos ; Mehta, Ruta ; Zick, Yair
• Automated Machine Learning For Computational Mechanics (Dagstuhl Seminar 24282)
  Raponi, Elena ; Kotthoff, Lars ; Kim, Hyunsun Alicia ; Lindauer, Marius
• 10211 Abstracts Collection – Flexible Network Design
  Gupta, Anupam ; Leonardi, Stefano ; Vöcking, Berthold ; Wattenhofer, Roger
• Sequential Parameter Optimization
  Bartz-Beielstein, Thomas
• On the (In)approximability of Combinatorial Contracts
  Ezra, Tomer ; Feldman, Michal ; Schlesinger, Maya 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• An Approximation Algorithm for Two-Edge-Connected Subgraph Problem via Triangle-Free Two-Edge-Cover
  Kobayashi, Yusuke ; Noguchi, Takashi 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Algorithms for 2-Connected Network Design and Flexible Steiner Trees with a Constant Number of Terminals
  Bansal, Ishan ; Cheriyan, Joe ; Grout, Logan ; Ibrahimpur, Sharat 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Experimental Design for Any p-Norm
  Lau, Lap Chi ; Wang, Robert ; Zhou, Hong 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Parameterized Algorithm for Vertex Connectivity Survivable Network Design Problem with Uniform Demands
  Bang-Jensen, Jørgen ; Klinkby, Kristine Vitting ; Misra, Pranabendu ; Saurabh, Saket 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Simple Runs-Bounded FM-Index Designs Are Fast
  Díaz-Domínguez, Diego ; Dönges, Saska ; Puglisi, Simon J. ; Salmela, Leena 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Quantum Algorithm for Path-Edge Sampling
  Jeffery, Stacey ; Kimmel, Shelby ; Piedrafita, Alvaro 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Finding Almost Tight Witness Trees
  Hyatt-Denesik, Dylan ; Jabal Ameli, Afrouz ; Sanità, Laura 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Approximation Algorithms for Network Design in Non-Uniform Fault Models
  Chekuri, Chandra ; Jain, Rhea 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A 4/3 Approximation for 2-Vertex-Connectivity
  Bosch-Calvo, Miguel ; Grandoni, Fabrizio ; Jabal Ameli, Afrouz 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Improved Approximation Algorithms by Generalizing the Primal-Dual Method Beyond Uncrossable Functions
  Bansal, Ishan ; Cheriyan, Joseph ; Grout, Logan ; Ibrahimpur, Sharat 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik