3-dimensional matching

Results: 15



#Item
1Algorithms 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

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

Add to Reading List

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

Language: English - Date: 2016-03-30 16:37:02
2OPTIMIZING 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

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

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2007-10-09 08:45:20
3CS364A: Algorithmic Game Theory Lecture #10: Kidney Exchange and Stable Matching∗ Tim Roughgarden† October 23,

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

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2015-09-22 16:36:22
4The center stable matchings and the centers of cover graphs of distributive lattices Christine T. Cheng∗ Eric McDermid†

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

Add to Reading List

Source URL: www.cs.uwm.edu

Language: English - Date: 2011-04-27 11:40:36
5Games, geometry, and [ the computational complexity of ] finding equilibria Bernhard von Stengel Department of Mathematics London School of Economics

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

Add to Reading List

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

Language: English - Date: 2006-07-13 23:31:34
6Blind, Greedy, and Random: Algorithms for Matching and Clustering using only Ordinal Information Elliot Anshelevich Shreyas Sekar

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

Add to Reading List

Source URL: www.cs.rpi.edu

Language: English - Date: 2015-12-01 10:37:13
7Figure 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

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

Add to Reading List

Source URL: press.ecpr.eu

- Date: 2014-06-06 11:44:07
    8String Range Matching Juha K¨arkk¨ainen Dominik Kempa Simon J. Puglisi

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

    Add to Reading List

    Source URL: www.cs.ucr.edu

    Language: English - Date: 2014-06-17 03:15:02
    9Pick 3 or Pickanother NP–complete 3-Dimensional Matching Variant Marzio De Biasi marziodebiasi [at] gmail [dot] com July 2014

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

    Add to Reading List

    Source URL: www.nearly42.org

    Language: English - Date: 2014-07-31 19:07:02
    10Learning Structured Prediction Models: A Large Margin Approach Ben Taskar Computer Science, UC Berkeley, Berkeley, CA[removed]removed]

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

    Add to Reading List

    Source URL: ai.stanford.edu

    Language: English - Date: 2005-10-04 19:09:30