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.

Robust Submodular Maximization: A Non-Uniform Partitioning Approach

Volkan Cevher, Jonathan Mark Scarlett, Ilija Bogunovic, Slobodan Mitrovic

We study the problem of maximizing a monotone submodular function subject to a cardinality constraint

k

, with the added twist that a number of items

\tau

from the returned set may be removed. We focus on the worst-case setting considered in Orlin et al ...

2017

Sparse Group Covers and Greedy Tree Approximations

Graph Chatbot

Chattez avec Graph Search

Efficient Allocations in Constant Time: Towards Scalable Solutions in the Era of Large Scale Intelligent Systems

New Graph Algorithms via Polyhedral Techniques

Actuator Placement for Optimizing Network Performance under Controllability Constraints

Approximating Steiner trees and forests with minimum number of Steiner points

Robust Submodular Maximization: A Non-Uniform Partitioning Approach

Strengths and Limitations of Linear Programming Relaxations

Optimal Software Patching Plan for PMUs

Efficient greedy algorithms for high-dimensional parameter spaces with applications to empirical interpolation and reduced basis methods

Right-Protected Data Publishing with Provable Distance-Based Mining

Steiner Tree Approximation via Iterative Randomized Rounding

New Graph Algorithms via Polyhedral Techniques

Efficient Allocations in Constant Time: Towards Scalable Solutions in the Era of Large Scale Intelligent Systems

Approximating Steiner trees and forests with minimum number of Steiner points

Actuator Placement for Optimizing Network Performance under Controllability Constraints

Strengths and Limitations of Linear Programming Relaxations

Robust Submodular Maximization: A Non-Uniform Partitioning Approach

Right-Protected Data Publishing with Provable Distance-Based Mining

Optimal Software Patching Plan for PMUs

Efficient greedy algorithms for high-dimensional parameter spaces with applications to empirical interpolation and reduced basis methods

Steiner Tree Approximation via Iterative Randomized Rounding