Algorithms and Data Structures Winter TermExercises for Units 37 & 38 1. For stable matching with incomplete lists, each man x ∈ X has a strict list x over a subset of the women Y, i.e., x is possibly incomp

Source URL: www-tcs.cs.uni-sb.de

• Mathematics
• Graph theory
• Matching
• Discrete mathematics
• Combinatorics
• Cooperative games
• Game theory
• Combinatorial optimization
• Stable marriage problem
• Stable roommates problem
• 3-dimensional matching

OPTIMIZING PHYLOGENETIC DIVERSITY ACROSS TWO TREES MAGNUS BORDEWICH, CHARLES SEMPLE, AND ANDREAS SPILLNER Abstract. We present a polynomial-time algorithm for finding an optimal set of taxa that maximizes the weighted-su

Source URL: community.dur.ac.uk

• Graph theory
• Mathematics
• Computational complexity theory
• NP-complete problems
• Combinatorial optimization
• Matching
• Flow network
• 3-dimensional matching
• Vertex cover

CS364A: Algorithmic Game Theory Lecture #10: Kidney Exchange and Stable Matching∗ Tim Roughgarden† October 23,

Source URL: theory.stanford.edu

• Graph theory
• Mathematics
• Matching
• Kidney transplantation
• Organ transplantation
• HopcroftKarp algorithm
• 3-dimensional matching

The center stable matchings and the centers of cover graphs of distributive lattices Christine T. Cheng∗ Eric McDermid†

Source URL: www.cs.uwm.edu

• Matching
• Lattice theory
• Combinatorial optimization
• Lattice
• Duality
• Bipartite graph
• Distributive lattice
• 3-dimensional matching
• Keyword cipher

Games, geometry, and [ the computational complexity of ] finding equilibria Bernhard von Stengel Department of Mathematics London School of Economics

Source URL: www.maths.lse.ac.uk

• Computational complexity theory
• Theory of computation
• Complexity classes
• NP
• Matching
• P
• Time complexity
• Decision problem
• P versus NP problem
• 3-dimensional matching

Blind, Greedy, and Random: Algorithms for Matching and Clustering using only Ordinal Information Elliot Anshelevich Shreyas Sekar

Source URL: www.cs.rpi.edu

• Matching
• Combinatorics
• NP-complete problems
• Combinatorial optimization
• Spanning tree
• Stable marriage problem
• Approximation algorithm
• 3-dimensional matching
• Minimum spanning tree

Figure 1.1: A Stemwijzer statement (left), the match-list (right) Figure 1.2: A EU Profiler statement (left), the two-dimensional matching (right) Figure 1.3: The smartvote questionnaire (left), the ‘smartspider’ ma

Source URL: press.ecpr.eu

String Range Matching Juha K¨arkk¨ainen Dominik Kempa Simon J. Puglisi

Source URL: www.cs.ucr.edu

• Complexity classes
• Combinatorial optimization
• Matching
• Algorithm
• String searching algorithm
• String
• FO
• 3-dimensional matching
• Theoretical computer science
• Mathematics
• Applied mathematics

Pick 3 or Pickanother NP–complete 3-Dimensional Matching Variant Marzio De Biasi marziodebiasi [at] gmail [dot] com July 2014

Source URL: www.nearly42.org

• Matching
• 3-dimensional matching
• Combinatorics
• Exact cover
• Numerical 3-dimensional matching
• Mathematics
• NP-complete problems
• Applied mathematics

Learning Structured Prediction Models: A Large Margin Approach Ben Taskar Computer Science, UC Berkeley, Berkeley, CA[removed]removed]

Source URL: ai.stanford.edu

• Mathematical optimization
• Operations research
• Linear programming
• Convex optimization
• Computational problems
• Optimization problem
• Semidefinite programming
• 3-dimensional matching
• Duality
• Mathematics
• Theoretical computer science
• Applied mathematics