Publication

Hardness of Approximating Flow and Job Shop Scheduling Problems

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

Node-weighted network design and maximum sub-determinants

Carsten Moldenhauer

We consider the Node-weighted Steiner Forest problem on planar graphs. Demaine et al. showed that a generic primal-dual algorithm gives a 6-approximation. We present two different proofs of an approximation factor of~

3

. Then, we draw a connection to Goem ...

EPFL2014

Hardness of Approximating Flow and Job Shop Scheduling Problems

Graph Chatbot

Chattez avec Graph Search

Results on Sparse Integer Programming and Geometric Independent Sets

The One-Way Communication Complexity of Submodular Maximization with Applications to Streaming and Robustness

Graph fragmentation problem: analysis and synthesis

Strengths and Limitations of Linear Programming Relaxations

Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach

Proactive Synthesis of Recursive Tree-to-String Functions from Examples

Group-Sparse Model Selection: Hardness and Relaxations

Approximation algorithms for regret minimization in vehicle routing problems

Node-weighted network design and maximum sub-determinants

Socially-Aware Large-Scale Crowd Forecasting

Results on Sparse Integer Programming and Geometric Independent Sets

Strengths and Limitations of Linear Programming Relaxations

Group-Sparse Model Selection: Hardness and Relaxations

Node-weighted network design and maximum sub-determinants

Proactive Synthesis of Recursive Tree-to-String Functions from Examples

Approximation algorithms for regret minimization in vehicle routing problems

Socially-Aware Large-Scale Crowd Forecasting

The One-Way Communication Complexity of Submodular Maximization with Applications to Streaming and Robustness

Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach

Graph fragmentation problem: analysis and synthesis