„Matching-Problem“

Suchergebnisse

522 Treffer

• Finding a Maximum 2-Matching Excluding Prescribed Cycles in Bipartite Graphs
  Takazawa, Kenjiro 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The Strongly Stable Roommates Problem
  Kunysz, Adam 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Data Structure Lower Bounds for Document Indexing Problems
  Afshani, Peyman ; Nielsen, Jesper Sindahl 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• On the Hardness of Partially Dynamic Graph Problems and Connections to Diameter
  Dahlgaard, Søren 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Dynamic Sketching for Graph Optimization Problems with Applications to Cut-Preserving Sketches
  Assadi, Sepehr ; Khanna, Sanjeev ; Li, Yang ; Tannen, Val 2015 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Fair Matchings and Related Problems
  Huang, Chien-Chung ; Kavitha, Telikepalli ; Mehlhorn, Kurt ; Michail, Dimitrios 2013 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs
  Datta, Samir ; Kulkarni, Raghav ; Tewari, Raghunath ; Vinodchandran, N. Variyam 2011 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• New Exact and Approximation Algorithms for the Star Packing Problem in Undirected Graphs
  Babenko, Maxim ; Gusakov, Alexey 2011 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Donation Center Location Problem
  Huang, Chien-Chung ; Svitkina, Zoya 2009 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• On the Induced Matching Problem
  Kanj, Iyad A. ; Pelsmajer, Michael J. ; Xia, Ge ; Schaefer, Marcus 2008 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Towards a Unified Theory of Sparsification for Matching Problems
  Assadi, Sepehr ; Bernstein, Aaron 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Partition of unity method on nonmatching grids for the Stokes problem
  Bacuta, C. ; Chen, J. ; Huang, Y. ; Xu, J. ; Zikatanov, L.
• The Regularized Weak Functional Matching Pursuit for linear inverse problems
  Kontak, Max ; Michel, Volker
• A Novel Approach to Research Synthesis with the Distillation and Matching Model: Application to the Prevention of Youth Social, Emotional, and Behavioral Problems
  Oddo, Lauren E. ; McLeod, Bryce D. ; Sutherland, Kevin S. ; Chow, Jason C. ; Ledford, Jennifer R. ; Li, Grace W.
• A novel approach to independent taxi scheduling problem based on stable matching
  Bai, Ruibin ; Li, Jiawei ; Atkin, Jason A D. ; Kendall, Graham
• Effiziente Methoden zum Lösen von 3D-Puzzle-Problemen * (Efficient Methods for Solving 3D-Puzzle-Problems)
  Winkelbach, Simon
• New graph algorithms via polyhedral techniques
  Tarnawski, Jakub
• Combinatorial Optimization – Theory and Algorithms
  Korte, Bernhard ; Vygen, Jens 2018 Springer Berlin
• Global synchromodal shipment matching problem with dynamic and stochastic travel times: a reinforcement learning approach
  Guo, Wenjing ; Atasoy, B. ; Negenborn, R. R.
• Investments and the Holdup Problem in a Matching Market
  Bester, Helmut