Asymptotically Optimal Hardness for 𝑘-Set Packing and 𝑘-Matroid Intersection

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.

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

In real-time optimization, the solution quality depends on the model ability to predict the plant KarushKuhn-Tucker (KKT) conditions. In the case of non-parametric plant-model mismatch, one can add input-affine modifiers to the model cost and constraints a ...

This work aims to study the effects of wind uncertainties in civil engineering structural design. Optimising the design of a structure for safety or operability without factoring in these uncertainties can result in a design that is not robust to these per ...

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

Given a source of iid samples of edges of an input graph G with n vertices and m edges, how many samples does one need to compute a constant factor approximation to the maximum matching size in G? Moreover, is it possible to obtain such an estimate in a sm ...

The gasification of highly watered waste residues may help to reduce fossil fuels consumption, as well as emissions, all the while improving efficiency. The integration of supercritical gasification with solar energy may improve the performances of both ne ...

A natural extension of the makespan minimization problem on unrelated machines is to allow jobs to be partially processed by different machines while incurring an arbitrary setup time. In this paper we present increasingly stronger LP-relaxations for this ...

The problem of finding "small" sets that meet every straight-line which intersects a given convex region was initiated by Mazurkiewicz in 1916. We call such a set an opaque set or a barrier for that region. We consider the problem of computing the shortest ...

The steady advance of computational methods makes model-based optimization an increasingly attractive method for process improvement. Unfortunately, the available models are often inaccurate. An iterative optimization method called "modifier adaptation" ov ...

We consider an imitation learning approach to model robot point-to-point (also known as discrete or reaching) movements with a set of autonomous Dynamical Systems (DS). Each DS model codes a behavior (such as reaching for a cup and swinging a golf club) at ...

We propose an algorithmic framework for convex minimization problems of a composite function with two terms: a self-concordant function and a possibly nonsmooth regularization term. Our method is a new proximal Newton algorithm that features a local quadra ...

A well studied special case of bin packing is the 3-partition problem, where n items of size > 1/4 have to be packed in a minimum number of bins of capacity one. The famous Karmarkar-Karp algorithm transforms a fractional solution of a suitable LP relaxati ...

In this paper, using the mathematical properties of self-kronecker-production of small size random matrices, a simple but effective method is presented to optimize the reservoir of an echo state network given a certain task. The experimental results invest ...

In this thesis, we focus on standard classes of problems in numerical optimization: unconstrained nonlinear optimization as well as systems of nonlinear equations. More precisely, we consider two types of unconstrained nonlinear optimization problems. On t ...

The graph coloring problem is one of the most famous problems in graph theory and has a large range of applications. It consists in coloring the vertices of an undirected graph with a given number of colors such that two adjacent vertices get different col ...

We consider the school bus routing and scheduling problem, where transportation demand is known and bus scheduling can be planned in advance. We present a comprehensive methodology designed to support the decision of practitioners. We first propose a model ...

Asymptotically Optimal Hardness for 𝑘-Set Packing and 𝑘-Matroid Intersection

Chat with Graph Search

Results on Sparse Integer Programming and Geometric Independent Sets

On improving the efficiency of modifier adaptation via directional information

Multi-Level Monte Carlo Methods for Uncertainty Quantification and Risk-Averse Optimisation

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

Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples

Optimal design methods applied to solar-assisted hydrothermal gasification plants

Strong LP formulations for scheduling splittable jobs on unrelated machines

Opaque Sets

Modifier Adaptation for Constrained Closed-Loop Systems

Learning control Lyapunov function to ensure stability of dynamical system-based robot reaching motions

A proximal Newton framework for composite minimization: Graph learning without Cholesky decompositions and matrix inversions

Bin Packing via Discrepancy of Permutations

Reservoir Optimization in Recurrent Neural Networks using Kronecker Kernels

Numerical methods and models relevant to transportation applications

Variations of coloring problems related to scheduling and discrete tomography

Decision-aid methodology for the school bus routing and scheduling problem