Publications associées à Sparse Group Covers and Greedy Tree Approximations

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

New Results in Integer and Lattice Programming

Christoph Hunkenschröder

An integer program (IP) is a problem of the form

\min \{f(x) : \, Ax = b, \ l \leq x \leq u, \ x \in \Z^n\}

, where

A \in \Z^{m \times n}

b \in \Z^m

l,u \in \Z^n

, and

f: \Z^n \rightarrow \Z

is a separable convex objective function. The problem o ...

EPFL2020

Sparse Group Covers and Greedy Tree Approximations

Graph Chatbot

Chattez avec Graph Search

Approximation Algorithms for Allocation and Network Design

Results on Sparse Integer Programming and Geometric Independent Sets

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

Discrete Optimal Transport with Independent Marginals is #P-Hard

Frequency-Domain Non-intrusive Greedy Model Order Reduction Based on Minimal Rational Approximation

Performance guarantees of forward and reverse greedy algorithms for minimizing nonsupermodular nonsubmodular functions on a matroid

Cluster-and-Conquer: When Randomness Meets Graph Locality

Actuator Placement under Structural Controllability using Forward and Reverse Greedy Algorithms

MATHICSE Technical Report : Frequency-domain non-intrusive greedy Model Order Reduction based on minimal rational approximation

New Results in Integer and Lattice Programming

Results on Sparse Integer Programming and Geometric Independent Sets

Approximation Algorithms for Allocation and Network Design

Performance guarantees of forward and reverse greedy algorithms for minimizing nonsupermodular nonsubmodular functions on a matroid

New Results in Integer and Lattice Programming

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

Cluster-and-Conquer: When Randomness Meets Graph Locality

MATHICSE Technical Report : Frequency-domain non-intrusive greedy Model Order Reduction based on minimal rational approximation

Frequency-Domain Non-intrusive Greedy Model Order Reduction Based on Minimal Rational Approximation

Actuator Placement under Structural Controllability using Forward and Reverse Greedy Algorithms

Discrete Optimal Transport with Independent Marginals is #P-Hard