Concept

Stable marriage problem

Related publications (37)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Association Generation in Synthetic Population for Transportation Applications: Graph-Theoretic Solution

Michel Bierlaire, Bilal Farooq, Dimitrios Efthymiou, Paul Richard Anderson

The generation of synthetic populations through simulation methods is an important research topic and has a key application in agent-based modeling of transport and land use. The next step in this research area is the generation of complete synthetic house ...

Natl Acad Sciences2014

d-Transversals of stable sets and vertex covers in weighted bipartite graphs

Dominique de Werra, Bernard Ries

Let G=(V,E)G=(V,E) be a graph in which every vertex v∈Vv∈V has a weight w(v)⩾0w(v)⩾0 and a cost c(v)⩾0c(v)⩾0. Let SGSG be the family of all maximum-weight stable sets in G . For any integer d⩾0d⩾0, a minimum d-transversal in the graph G with respect to SGS ...

2012

LDAHash: Improved Matching with Smaller Descriptors

Pascal Fua, Christoph Strecha

SIFT-like local feature descriptors are ubiquitously employed in computer vision applications such as content-based retrieval, video analysis, copy detection, object recognition, photo tourism, and 3D reconstruction. Feature descriptors can be designed to ...

Institute of Electrical and Electronics Engineers2012

An algorithmic decomposition of claw-free graphs leading to an O(n^3) algorithm for the weighted stable set problem

Yuri Faenza, Gautier Stauffer

We propose an algorithm for solving the maximum weighted stable set problem on claw-free graphs that runs in O(n^3)-time, drastically improving the previous best known complexity bound. This algorithm is based on a novel decomposition theorem for claw-free ...

2011

Minimum d-blockers and d-transversals in graphs

Dominique de Werra

We consider a set V of elements and an optimization problem on V: the search for a maximum (or minimum) cardinality subset of V verifying a given property a"similar to. A d-transversal is a subset of V which intersects any optimum solution in at least d el ...

2011

Mechanisms for the Marriage and the Assignment Game

Monika Henzinger

Starting with two models fifty years ago, the discrete marriage game [1] and the continuous assignment game [2], the study of stable matchings has evolved into a rich theory with applications in many areas. Most notably, it has lead to a number of truthful ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2010

LDAHash: Improved matching with smaller descriptors

Pascal Fua, Christoph Strecha

SIFT-like local feature descriptors are ubiquitously employed in such computer vision applications as content-based retrieval, video analysis, copy detection, object recognition, photo-tourism and 3D reconstruction. Feature descriptors can be designed to b ...

2010

Le corps comme variable expérimentale

Frédéric Kaplan

L’évolution des concepts de corps et de processus d’animation dans le domaine de la robotique conduit aujourd’hui à définir le concept d’un noyau, ensemble d’algorithmes stables, indépendant des espaces corporels auxquels ils s’appliquent. Il devient alors ...

2008

The stable set polytope of quasi-line graphs

Friedrich Eisenbrand, Gautier Stauffer

It is a long standing open problem to find an explicit description of the stable set polytope of claw-free graphs. Yet more than 20 years after the discovery of a polynomial algorithm for the maximum stable set problem for claw-free graphs, there is even n ...

2008

Stable marriage problem

Graph Chatbot

Chat with Graph Search

Association Generation in Synthetic Population for Transportation Applications: Graph-Theoretic Solution

d-Transversals of stable sets and vertex covers in weighted bipartite graphs

LDAHash: Improved Matching with Smaller Descriptors

An algorithmic decomposition of claw-free graphs leading to an O(n^3) algorithm for the weighted stable set problem

Minimum d-blockers and d-transversals in graphs

Mechanisms for the Marriage and the Assignment Game

Sponsored Search, Market Equilibria, and the Hungarian Method

LDAHash: Improved matching with smaller descriptors

Le corps comme variable expérimentale

The stable set polytope of quasi-line graphs

Minimum d-blockers and d-transversals in graphs

An algorithmic decomposition of claw-free graphs leading to an O(n^3) algorithm for the weighted stable set problem

Association Generation in Synthetic Population for Transportation Applications: Graph-Theoretic Solution

LDAHash: Improved Matching with Smaller Descriptors

Mechanisms for the Marriage and the Assignment Game

Sponsored Search, Market Equilibria, and the Hungarian Method

LDAHash: Improved matching with smaller descriptors

d-Transversals of stable sets and vertex covers in weighted bipartite graphs

Le corps comme variable expérimentale

The stable set polytope of quasi-line graphs