Publications associées à Representative explanations for over-constrained problems

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.

LP-Based Algorithms For Capacitated Facility Location

Ola Nils Anders Svensson, Hyung Chan An

Linear programming (LP) has played a key role in the study of algorithms for combinatorial optimization problems. In the field of approximation algorithms, this is well illustrated by the uncapacitated facility location problem. A variety of algorithmic me ...

Society for Industrial and Applied Mathematics2017

Dynamic Facility Location via Exponential Clocks

Ola Nils Anders Svensson, Ashkan Norouzi Fard, Hyung Chan An

The dynamic facility location problem is a generalization of the classic facility location problem proposed by Eisenstat, Mathieu, and Schabanel to model the dynamics of evolving social/infrastructure networks. The generalization lies in that the distance ...

Association for Computing Machinery2017

Comparing genomes with rearrangements and segmental duplications

Bernard Moret, Mingfu Shao

Motivation: Large-scale evolutionary events such as genomic rearrange. ments and segmental duplications form an important part of the evolution of genomes and are widely studied from both biological and computational perspectives. A basic computational pro ...

Oxford University Press2015

Maximizing Symmetric Submodular Functions

Moran Feldman

Symmetric submodular functions are an important family of submodular functions capturing many interesting cases including cut functions of graphs and hypergraphs. In this work, we identify submodular maximization problems for which one can get a better app ...

Springer Int Publishing Ag2015

Improving Christofides' Algorithm for the s-t Path TSP

Hyung Chan An

We present a deterministic (1+root 5/2)-approximation algorithm for the s-t path TSP for an arbitrary metric. Given a symmetric metric cost on n vertices including two prespecified endpoints, the problem is to find a shortest Hamiltonian path between the t ...

Assoc Computing Machinery2015

Multi-objective optimization of SNG production from microalgae through hydrothermal gasification

François Maréchal, Adriano Viana Ensinas, Alberto Mian

The conversion of microalgae biomass into biofuels is a quite well explored field of research. Due to high photosynthetic efficiency, microalgae are considered as a potential feedstock for next-generations biofuel conversion processes. This paper addresses ...

2015

Coding Structure and Replication Optimization for Interactive Multiview Video Streaming

Pascal Frossard

Multiview video refers to videos of the same dynamic 3-D scene captured simultaneously by multiple closely spaced cameras from different viewpoints. We study interactive streaming of pre-encoded multiview videos, where, at any time, a client can request an ...

Ieee-Inst Electrical Electronics Engineers Inc2014

LP-Based Algorithms for Capacitated Facility Location

Ola Nils Anders Svensson, Hyung Chan An

Linear programming has played a key role in the study of algorithms for combinatorial optimization problems. In the field of approximation algorithms, this is well illustrated by the uncapacitated facility location problem. A variety of algorithmic methodo ...

IEEE2014

Representative explanations for over-constrained problems

Graph Chatbot

Chattez avec Graph Search

New Algorithmic Paradigms for Discrete Problems using Dynamical Systems and Polynomials

Strengths and Limitations of Linear Programming Relaxations

LP-Based Algorithms For Capacitated Facility Location

Dynamic Facility Location via Exponential Clocks

Comparing genomes with rearrangements and segmental duplications

Maximizing Symmetric Submodular Functions

Improving Christofides' Algorithm for the s-t Path TSP

Multi-objective optimization of SNG production from microalgae through hydrothermal gasification

Coding Structure and Replication Optimization for Interactive Multiview Video Streaming

LP-Based Algorithms for Capacitated Facility Location

Strengths and Limitations of Linear Programming Relaxations

New Algorithmic Paradigms for Discrete Problems using Dynamical Systems and Polynomials

Dynamic Facility Location via Exponential Clocks

Comparing genomes with rearrangements and segmental duplications

Improving Christofides' Algorithm for the s-t Path TSP

LP-Based Algorithms For Capacitated Facility Location

Coding Structure and Replication Optimization for Interactive Multiview Video Streaming

Maximizing Symmetric Submodular Functions

Multi-objective optimization of SNG production from microalgae through hydrothermal gasification

LP-Based Algorithms for Capacitated Facility Location