Publications associées à Sampling to provide or to bound: With applications to fully dynamic graph algorithms

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

Sampling to provide or to bound: With applications to fully dynamic graph algorithms

Graph Chatbot

Chattez avec Graph Search

The Two Times Problem: Where Is the Problem?

Results on Sparse Integer Programming and Geometric Independent Sets

Approximation Algorithms for Allocation and Network Design

Minimum Cost Intervention Design for Causal Effect Identification

Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds

Actuator Placement under Structural Controllability using Forward and Reverse Greedy Algorithms

New Results in Integer and Lattice Programming

New Graph Algorithms via Polyhedral Techniques

Anytime Heuristic for Weighted Matching Through Altruism-Inspired Behavior

Overlapping Multi-Bandit Best Arm Identification

Results on Sparse Integer Programming and Geometric Independent Sets

Approximation Algorithms for Allocation and Network Design

Minimum Cost Intervention Design for Causal Effect Identification

Overlapping Multi-Bandit Best Arm Identification

The Two Times Problem: Where Is the Problem?

Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds

Anytime Heuristic for Weighted Matching Through Altruism-Inspired Behavior

Actuator Placement under Structural Controllability using Forward and Reverse Greedy Algorithms

New Results in Integer and Lattice Programming

New Graph Algorithms via Polyhedral Techniques