Integer points in the degree-sequence polytope

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.

Energy communities are key actors in the energy transition since they optimally interconnect renewable energy capacities with the consumers. Despite versatile objectives, they usually aim at improving the self-consumption of renewable electricity within lo ...

We study an important case of integer linear programs (ILPs) of the form max{c(T)x vertical bar Ax = b, l

We propose a (epsilon, delta)-differentially private mechanism that, given an input graph G with n vertices and m edges, in polynomial time generates a synthetic graph G' approximating all cuts of the input graph up to an additive error of O (root mn/epsil ...

This paper formulates a multitask optimization problem where agents in the network have individual objectives to meet, or individual parameter vectors to estimate, subject to a smoothness condition over the graph. The smoothness condition softens the trans ...

Symmetric submodular functions are an important family of submodular functions capturing many interesting cases, including cut functions of graphs and hypergraphs. Maximization of such functions subject to various constraints receives little attention by c ...

We present a framework for approximating the metric TSP based on a novel use of matchings. Traditionally, matchings have been used to add edges to make a given graph Eulerian, whereas our approach also allows for the removal of certain edges leading to a d ...

In this paper, we design a new iterative low-complexity algorithm for computing the Walsh-Hadamard transform (WHT) of an N dimensional signal with a K-sparse WHT. We suppose that N is a power of two and K = O(N^α), scales sub-linearly in N for some α ∈ (0, ...

This paper reviews two simple numerical algorithms particularly useful in Computational ElectroMagnetics (CEM): the Weighted Averages (WA) algorithm and the Double Exponential (DE) quadrature. After a short historical introduction and an elementary descrip ...

The objective of this work is to develop a numerical framework to perform rapid and reliable simulations for solving parametric problems in domains represented by networks and to extend the classical reduced basis method. Aimed at this scope, we propose tw ...

We summarize classical and recent results about two-player games played on graphs with omega-regular objectives. These games have applications in the verification and synthesis of reactive systems. Important distinctions are whether a graph game is turn-ba ...

Various algorithms have been proposed for the problem of quality-driven service composition. They differ by the quality of the resulting executable processes and by their processing costs. In this paper, we study the problem of service composition from an ...

Research on sub-optimal Model Predictive Control (MPC) has led to a variety of optimization methods based on explicit or online approaches, or combinations thereof. Its foremost aim is to guarantee essential controller properties, i.e. recursive feasibilit ...

The Steiner tree problem is one of the most fundamental

\mathbf{NP}

-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum-cost tree spanning the terminals. In a sequence of papers, the approximation ratio for thi ...

In this paper, we consider the recovery of an airline schedule after an unforeseen event called disruption, making the planned schedule infeasible. We present a modeling framework that allows the consideration of operational constraints within a Column Gen ...

In the past few years, the problem of distributed consensus has received a lot of attention, particularly in the framework of ad hoc sensor networks. Most methods proposed in the literature address the consensus averaging problem by distributed linear iter ...

Integer points in the degree-sequence polytope

Chat with Graph Search

From Local Energy Communities towards National Energy System: A Grid-Aware Techno-Economic Analysis

NEAR-LINEAR TIME ALGORITHM FOR n-FOLD ILPs VIA COLOR CODING

Differentially Private Release of Synthetic Graphs

Learning Over Multitask Graphs-Part I: Stability Analysis

Maximizing Symmetric Submodular Functions

Removing and Adding Edges for the Traveling Salesman Problem

A Fast Hadamard Transform for Signals with Sub-linear Sparsity in the Transform Domain

Weighted Averages and Double Exponential Algorithms

Reduced Basis Methods for the Solution of Parametrized PDEs in Repetitive and Complex Networks with Application to CFD

A survey of stochastic omega-regular games

Dynamically Selecting Composition Algorithms for Economical Composition as a Service

Input-to-state stabilization of feasible model predictive controllers for linear systems

An Improved LP-based Approximation for Steiner Tree

Constraint-specific recovery networks for solving airline recovery problems

Polynomial Filtering for Fast Convergence in Distributed Consensus