„exact algorithms“

Suchergebnisse

1.000+ Treffer

• Exact Exponential Algorithms for Clustering Problems
  Fomin, Fedor V. ; Golovach, Petr A. ; Inamdar, Tanmay ; Purohit, Nidhi ; Saurabh, Saket 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Exact and Numerical Solutions of the Riemann Problem for a Conservative Model of Compressible Two-Phase Flows
  Thein, Ferdinand ; Romenskij, Evgenij I. ; Dumbser, Michael
• Exact Algorithms for Graph Homomorphisms
  Fomin, Fedor V. ; Heggernes, Pinar ; Kratsch, Dieter
• CodingMotif: exact determination of overrepresented nucleotide motifs in coding sequences
  Ding, Yang ; Lorenz, William A. ; Chuang, Jeffrey H.
• Bacterial syntenies: an exact approach with gene quorum
  Deniélou, Yves-Pol ; Sagot, Marie-France ; Boyer, Frédéric ; Viari, Alain
• PMS5: an efficient exact algorithm for the (ℓ, d)-motif finding problem
  Dinh, Hieu ; Rajasekaran, Sanguthevar ; Kundeti, Vamsi K.
• Exact score distribution computation for ontological similarity searches
  Schulz, Marcel H. ; Köhler, Sebastian ; Bauer, Sebastian ; Robinson, Peter N.
• Exact and Heuristic Algorithms for Dynamic Tree Simplification
  Correa, Carlos María ; Marsic, Ivan ; Sun, Xiaodong
• Improving the perfomance of elevator systems using exact reoptimization algorithms
  Hiller, Benjamin ; Klug, Torsten ; Andreas Tuchscherer
• 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
• 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
• Exact and approximation algorithms for routing a convoy through a graph
  Ee, Martijn ˜vanœ ; Oosterwijk, Tim ; Sitters, René ; Wiese, Andreas
• Algorithms and certificates for exact Mixed Integer Programming
  Eifler, Leon ; Koch, Thorsten ; Gleixner, Ambros ; Coniglio, Stefano ; Berthold, Timo 2025 Technische Universität Berlin
• Exact and approximation algorithms for weighted matroid intersection
  Huang, Chien-Chung ; Kakimura, Naonori ; Kamiyama, Naoyuki
• Isolation Schemes for Problems on Decomposable Graphs
  Nederlof, Jesper ; Pilipczuk, Michał ; Swennenhuis, Céline M. F. ; Węgrzycki, Karol 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• PACE Solver Description: UzL Solver for Dominating Set and Hitting Set
  Bannach, Max ; Chudigiewitsch, Florian ; Wienöbst, Marcel 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• PACE Solver Description: HitS&DoSeS - Exact and Heuristic Solvers for the Dominating Set and Hitting Set Problems
  Swat, Sylwester 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Exact Algorithms and Hardness Result for the Boolean Connectivity Problem of k-Horn Formulas
  Horiyama, Takashi ; Okura, Yuto ; Seto, Kazuhisa ; Teruyama, Junichi 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Exact and heuristic algorithms for 2-layer straightline crossing minimization
  Jünger, Michael ; Mutzel, Petra 1995 MPI Informatik, Bibliothek & Dokumentation
• Exact and approximation algorithms for many-visits travelling salesperson problems
  Vincze, Roland ; Mnich, Matthias 2022 Universitätsbibliothek der Technischen Universität Hamburg