Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples

Related publications (29)

About
Privacy
Disclaimer

Graph Chatbot

Characterization of Transverse Instabilities Driven by Electron Cloud

Electron cloud continues to be one of the main limiting factors of the Large Hadron Collider (LHC), the biggest accelerator at CERN. These clouds form in the beam chamber when positively charged particles are passing through and cause unwanted effects in b ...

EPFL2024

Results on Sparse Integer Programming and Geometric Independent Sets

Jana Tabea Cslovjecsek

An integer linear program is a problem of the form max{c^T x : Ax=b, x >= 0, x integer}, where A is in Z^(n x m), b in Z^m, and c in Z^n. Solving an integer linear program is NP-hard in general, but there are several assumptions for which it becomes fixed ...

EPFL2023

Approximation Algorithms for Allocation and Network Design

Etienne Michel François Bamas

In this thesis, we give new approximation algorithms for some NP-hard problems arising in resource allocation and network design. As a resource allocation problem, we study the Santa Claus problem (also known as the MaxMin Fair Allocation problem) in which ...

EPFL2023

Equivariant Neural Architectures for Representing and Generating Graphs

Clément Arthur Yvon Vignac

Graph machine learning offers a powerful framework with natural applications in scientific fields such as chemistry, biology and material sciences. By representing data as a graph, we encode the prior knowledge that the data is composed of a set of entiti ...

EPFL2023

Traversing Time Dependent Light Fields for Daylight Glare Evaluation

Stephen William Wasilewski

To understand how daylight gives shape and life to architectural spaces, whether existing or imagined, requires quantifying its dynamism and energy. Maintaining these details presents a challenge to simulation and analysis methods that flatten data into di ...

EPFL2023

Better Trees for Santa Claus

Etienne Michel François Bamas, Lars Rohwedder

We revisit the problem max-min degree arborescence, which was introduced by Bateni et al. [STOC'09] as a central special case of the general Santa Claus problem, which constitutes a notorious open question in approximation algorithms. In the former problem ...

Assoc Computing Machinery2023

Maximum Independent Set: Self-Training through Dynamic Programming

Volkan Cevher, Grigorios Chrysos, Efstratios Panteleimon Skoulakis

This work presents a graph neural network (GNN) framework for solving the maximum independent set (MIS) problem, inspired by dynamic programming (DP). Specifically, given a graph, we propose a DP-like recursive algorithm based on GNNs that firstly construc ...

2023

PINION: physics-informed neural network for accelerating radiative transfer simulations for cosmic reionization

Jean-Paul Richard Kneib, Emma Elizabeth Tolley, Michele Bianco

With the advent of the Square Kilometre Array Observatory (SKAO), scientists will be able to directly observe the Epoch of Reionization by mapping the distribution of neutral hydrogen at different redshifts. While physically motivated results can be simula ...

OXFORD UNIV PRESS2023

Multi-robot task allocation for safe planning against stochastic hazard dynamics

Maryam Kamgarpour, Orcun Karaca

We address multi-robot safe mission planning in uncertain dynamic environments. This problem arises in several applications including safety-critical exploration, surveillance, and emergency rescue missions. Computation of a multi-robot optimal control pol ...

IEEE2023

Page 3 of 3