Publication

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

Publications associées (32)

Graph Chatbot

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.

Connectez-vous pour utiliser Chat avec Graph Search

The potential to improve the choice: list conflict-free coloring for geometric hypergraphs

Shakhar Smorodinsky

Given a geometric hypergraph (or a range-space)

H=(V,\cal E)

, a coloring of its vertices is said to be conflict-free if for every hyperedge

S \in \cal E

there is at least one vertex in

S

whose color is distinct from the colors of all other vertices i ...

2010

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

Graph Chatbot

Chattez avec Graph Search

An Efficient Streaming Algorithm for the Submodular Cover Problem

Sparse Group Covers and Greedy Tree Approximations

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

The potential to improve the choice: list conflict-free coloring for geometric hypergraphs

On the Submodularity of Linear Experimental Design

Some coloring and walking problems in graphs

Optimal polynomial-time interprocedural register allocation for high-level synthesis and ASIP design

Kernel Matching Pursuit for Large Datasets

Suboptimal colorings and solution of large chromatic scheduling problems

Partitioning cographs into cliques and stable sets

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

Kernel Matching Pursuit for Large Datasets

On the Submodularity of Linear Experimental Design

Optimal polynomial-time interprocedural register allocation for high-level synthesis and ASIP design

Suboptimal colorings and solution of large chromatic scheduling problems

Partitioning cographs into cliques and stable sets

Sparse Group Covers and Greedy Tree Approximations

An Efficient Streaming Algorithm for the Submodular Cover Problem

Some coloring and walking problems in graphs

The potential to improve the choice: list conflict-free coloring for geometric hypergraphs