Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Stable marriage problem

Related publications (28)

Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition

Yuri Faenza, Gautier Stauffer

We propose an algorithm for solving the maximum weighted stable set problem on claw-free graphs that runs in O(vertical bar V vertical bar (vertical bar E vertical bar+vertical bar V vertical bar log vertical bar V vertical bar))-time, drastically improvin ...

Assoc Computing Machinery2014

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

Michel Bierlaire, Bilal Farooq, Dimitrios Efthymiou

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 ...

National Academy of Sciences2014

Node-weighted network design and maximum sub-determinants

Carsten Moldenhauer

We consider the Node-weighted Steiner Forest problem on planar graphs. Demaine et al. showed that a generic primal-dual algorithm gives a 6-approximation. We present two different proofs of an approximation factor of~

3

. Then, we draw a connection to Goem ...

EPFL2014

Remote Powering and Wireless Communication of a Smart Knee Prosthesis

Oguz Atasoy

With the advance in microelectronics and microsystems, better instruments in every domain are designed and built. For many years, scientists have tried to understand nature, and engineers to mimic the perfect design. One example of this is the human knee, ...

EPFL2013

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

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

3

. Then, we draw a connection to Goem ...

EPFL2014

Stable marriage problem

Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition

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

Node-weighted network design and maximum sub-determinants

Remote Powering and Wireless Communication of a Smart Knee Prosthesis

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

LDAHash: Improved Matching with Smaller Descriptors

Minimum d-blockers and d-transversals in graphs

Sponsored Search, Market Equilibria, and the Hungarian Method

Graph Chatbot

Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition

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

Node-weighted network design and maximum sub-determinants

Remote Powering and Wireless Communication of a Smart Knee Prosthesis

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

LDAHash: Improved Matching with Smaller Descriptors

Minimum d-blockers and d-transversals in graphs

Sponsored Search, Market Equilibria, and the Hungarian Method