Publication

Weighted Matchings via Unweighted Augmentations

Ola Nils Anders Svensson, Buddhima Ruwanmini Gamlath Gamlath Ralalage, Sagar Sudhir Kale
2019
Conference Papers

Abstract

We design a generic method to reduce the task of finding weighted matchings to that of finding short augmenting paths in unweighted graphs. This method enables us to provide efficient implementations for approximating weighted matchings in the massively parallel computation (MPC) model and in the streaming model.

Official source

https://infoscience.epfl.ch/entities/publication/2d69cefe-e0a7-47cb-b802-bbcb4f9470b2

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

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.

Weighted Matchings via Unweighted Augmentations

Chat with Graph Search

A Distributed Augmenting Path Approach for the Bottleneck Assignment Problem

Recovering Static and Time-Varying Communities Using Persistent Edges

The Power of Two Matrices in Spectral Algorithms for Community Recovery