Publications related to Node-weighted network design and maximum sub-determinants

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.

fGOT: Graph Distances Based on Filters and Optimal Transport

Pascal Frossard, Mireille El Gheche, Hermina Petric Maretic, Giovanni Chierchia

Graph comparison deals with identifying similarities and dissimilarities between graphs. A major obstacle is the unknown alignment of graphs, as well as the lack of accurate and inexpensive comparison metrics. In this work we introduce the filter graph dis ...

ASSOC ADVANCEMENT ARTIFICIAL INTELLIGENCE2022

Spectral Hypergraph Sparsifiers of Nearly Linear Size

Mikhail Kapralov, Jakab Tardos

Graph sparsification has been studied extensively over the past two decades, culminating in spectral sparsifiers of optimal size (up to constant factors). Spectral hypergraph sparsification is a natural analogue of this problem, for which optimal bounds on ...

IEEE COMPUTER SOC2022

Flow Time Scheduling and Prefix Beck-Fiala

Ola Nils Anders Svensson, Lars Rohwedder

We relate discrepancy theory with the classic scheduling problems of minimizing max flow time and total flow time on unrelated machines. Specifically, we give a general reduction that allows us to transfer discrepancy bounds in the prefix Beck-Fiala (bound ...

ASSOC COMPUTING MACHINERY2022

A (2+epsilon)-Approximation Algorithm for Preemptive Weighted Flow Time on a Single Machine

Lars Rohwedder

Weighted flow time is a fundamental and very well-studied objective function in scheduling. In this paper, we study the setting of a single machine with preemptions. The input consists of a set of jobs, characterized by their processing times, release time ...

ASSOC COMPUTING MACHINERY2021

Faster Monotone Min-Plus Product, Range Mode, and Single Source Replacement Paths

Adam Teodor Polak

One of the most basic graph problems, All-Pairs Shortest Paths (APSP) is known to be solvable in n^{3-o(1)} time, and it is widely open whether it has an O(n^{3-ε}) time algorithm for ε > 0. To better understand APSP, one often strives to obtain subcubic t ...

Schloss Dagstuhl -- Leibniz-Zentrum für Informatik2021

Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity

Friedrich Eisenbrand, Moritz Andreas Venzin, Jana Tabea Cslovjecsek

We consider the problem of solving integer programs of the form min {c^⊺ x : Ax = b, x ∈ ℤ_{⩾ 0}}, where A is a multistage stochastic matrix in the following sense: the primal treedepth of A is bounded by a parameter d, which means that the columns of A ca ...

Schloss Dagstuhl - Leibniz-Zentrum für Informatik2021

How to Match in Modern Computational Settings

Buddhima Ruwanmini Gamlath Gamlath Ralalage

This thesis focuses on the maximum matching problem in modern computational settings where the algorithms have to make decisions with partial information.First, we consider two stochastic models called query-commit and price-of-information where the algori ...

EPFL2021

Vessel scheduling with pilotage and tugging considerations

Michel Bierlaire

This paper considers vessel scheduling with pilotage and tugging constraints in berthing operations with channel restrictions at seaports. To our knowledge, pilotage and tugging requirements have not been simultaneously considered in the literature. This w ...

PERGAMON-ELSEVIER SCIENCE LTD2021

A unifying framework for form-finding and topology-finding of tensegrity structures

Yafeng Wang

This paper presents a unifying framework for the form-finding and topology-finding of tensegrity structures. The novel computational framework is based on rank-constrained linear matrix inequalities. For form-finding, given the topology (i.e., member conne ...

PERGAMON-ELSEVIER SCIENCE LTD2021

Node-weighted network design and maximum sub-determinants

Graph Chatbot

Chat with Graph Search

fGOT: Graph Distances Based on Filters and Optimal Transport

Spectral Hypergraph Sparsifiers of Nearly Linear Size

Flow Time Scheduling and Prefix Beck-Fiala

A (2+epsilon)-Approximation Algorithm for Preemptive Weighted Flow Time on a Single Machine

Faster Monotone Min-Plus Product, Range Mode, and Single Source Replacement Paths

Sublinear Algorithms for Spectral Graph Clustering

Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity

How to Match in Modern Computational Settings

Vessel scheduling with pilotage and tugging considerations

A unifying framework for form-finding and topology-finding of tensegrity structures

A (2+epsilon)-Approximation Algorithm for Preemptive Weighted Flow Time on a Single Machine

Spectral Hypergraph Sparsifiers of Nearly Linear Size

fGOT: Graph Distances Based on Filters and Optimal Transport

Sublinear Algorithms for Spectral Graph Clustering

A unifying framework for form-finding and topology-finding of tensegrity structures

How to Match in Modern Computational Settings

Vessel scheduling with pilotage and tugging considerations

Faster Monotone Min-Plus Product, Range Mode, and Single Source Replacement Paths

Flow Time Scheduling and Prefix Beck-Fiala

Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity