„combinatorial algorithm“

Suchergebnisse

8.292 Treffer

• Algorithmic Combinatorial Game Theory (Dagstuhl Seminar 02081)
  Demaine, Erik D. ; Fleischer, Rudolf ; Fraenkel, Avierzi ; Nowakowski, Richard 2002 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Discrete Algorithms on Modern and Emerging Compute Infrastructure (Dagstuhl Seminar 24201)
  Hanauer, Kathrin ; Naumann, Uwe ; Pothen, Alex ; Schreiber, Robert
• Beyond-Planar Graphs: Models, Structures and Geometric Representations (Dagstuhl Seminar 24062)
  Dujmović, Vida ; Hong, Seok-Hee ; Kaufmann, Michael ; Pach, János ; Förster, Henry
• Recent Trends in Graph Decomposition (Dagstuhl Seminar 23331)
  Karypis, George ; Schulz, Christian ; Strash, Darren ; Ajwani, Deepak ; Bisseling, Rob H. ; Casel, Katrin ; Çatalyürek, Ümit V. ; Chevalier, Cédric ; Chudigiewitsch, Florian ; Faraj, Marcelo Fonseca ; Fellows, Michael ; Gottesbüren, Lars ; Heuer, Tobias ; Kaya, Kamer ; Lacki, Jakub ; Langguth, Johannes ; Li, Xiaoye Sherry ; Mayer, Ruben ; Meintrup, Johannes ; Mizutani, Yosuke ; Pellegrini, François ; Petrini, Fabrizio ; Rosamond, Frances ; Safro, Ilya ; Schlag, Sebastian ; Sharma, Roohani ; Sullivan,
• Graph decomposition techniques for solving combinatorial optimization problems with variational quantum algorithms
  Ponce, Moises ; Herrman, Rebekah ; Lotshaw, Phillip C. ; Powers, Sarah ; Siopsis, George ; Humble, Travis ; Ostrowski, James
• Combinatorial Approximation Algorithms (Dagstuhl Seminar 9734)
  Rabani, Yuval ; Shmoys, David ; Woeginger, Gerhard 1998 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Machine Learning Augmented Algorithms for Combinatorial Optimization Problems (Dagstuhl Seminar 24441)
  Ajwani, Deepak ; Dilkina, Bistra ; Guns, Tias ; Meyer, Ulrich Carsten
• Differentially Private Combinatorial Optimization
  Talwar, Kunal ; Gupta, Anupam ; Ligett, Katrina ; McSherry, Frank ; Roth, Aaron
• On the (In)approximability of Combinatorial Contracts
  Ezra, Tomer ; Feldman, Michal ; Schlesinger, Maya 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Distributed Algorithms as a Gateway To Deductive Learning (Invited Talk)
  Wattenhofer, Roger 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Combinatorial Certifying Algorithm for Linear Programming Problems with Gainfree Leontief Substitution Systems
  Kimura, Kei ; Makino, Kazuhisa 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Round and Bipartize for Vertex Cover Approximation
  Kashaev, Danish ; Schäfer, Guido 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Constant-Factor Approximation for Quasi-Bipartite Directed Steiner Tree on Minor-Free Graphs
  Friggstad, Zachary ; Mousavi, Ramin 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Cutting Planes Width and the Complexity of Graph Isomorphism Refutations
  Torán, Jacobo ; Wörz, Florian 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Faster Matroid Partition Algorithms
  Terao, Tatsuya 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Tight (1.5+ε)-Approximation for Unsplittable Capacitated Vehicle Routing on Trees
  Mathieu, Claire ; Zhou, Hang 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• An O(log k)-Approximation for Directed Steiner Tree in Planar Graphs
  Friggstad, Zachary ; Mousavi, Ramin 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Algorithms for Length Spectra of Combinatorial Tori
  Delecroix, Vincent ; Ebbens, Matthijs ; Lazarus, Francis ; Yakovlev, Ivan 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Parabolic optimal control problems with combinatorial switching constraints, part III: branch-and-bound algorithm
  Buchheim, Christoph ; Grütering, Alexandra ; Meyer, Christian
• A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems
  Henzinger, Monika ; Jin, Billy ; Peng, Richard ; Williamson, David P. 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik