Publications associées à Integer points in the degree-sequence polytope

Publications associées (15)

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

Joseph René Hubert Loustau, François Maréchal, Cédric Terrier, Dorsan Alexis A. Lepour

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

MDPI2024

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

Lars Rohwedder

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

SIAM Publications2020

Differentially Private Release of Synthetic Graphs

Mikhail Kapralov, Marek Elias

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

ASSOC COMPUTING MACHINERY2020

Learning Over Multitask Graphs-Part I: Stability Analysis

Ali H. Sayed, Stefan Vlaski, Roula Nassif

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

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

Maximizing Symmetric Submodular Functions

Moran Feldman

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

Association for Computing Machinery2017

Removing and Adding Edges for the Traveling Salesman Problem

Ola Nils Anders Svensson

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

Assoc Computing Machinery2016

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

Martin Vetterli, Robin Scheibler, Saeid Haghighatshoar

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

Institute of Electrical and Electronics Engineers2015

Weighted Averages and Double Exponential Algorithms

Juan Ramon Mosig

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

Ieice-Inst Electronics Information Communications Eng2013

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

Laura Iapichino

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

EPFL2012

A survey of stochastic omega-regular games

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

2012

Dynamically Selecting Composition Algorithms for Economical Composition as a Service

Boi Faltings, Immanuel Trummer

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

Springer-Verlag Berlin2011

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

Colin Neil Jones, Melanie Nicole Zeilinger

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

2011

An Improved LP-based Approximation for Steiner Tree

Thomas Rothvoss, Laura Sanità

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

Acm Order Department, P O Box 64145, Baltimore, Md 21264 Usa2010

Constraint-specific recovery networks for solving airline recovery problems

Michel Bierlaire, Matteo Salani

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

2010

Polynomial Filtering for Fast Convergence in Distributed Consensus

Pascal Frossard, Effrosyni Kokiopoulou

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

2009