Publications related to Maximizing Symmetric Submodular Functions

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

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. Maximization of such functions subject to various constraints receives little attention by c ...

Association for Computing Machinery2017

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

Optimal Hybrid Perimeter and Switching Plans Control for Urban Traffic Networks

Nikolaos Geroliminis, Jack Haddad, Mohammadreza Hajiahmadi

Since centralized control of urban networks with detailed modeling approaches is computationally complex, developing efficient hierarchical control strategies based on aggregate modeling is of great importance. The dynamics of a heterogeneous large-scale u ...

Institute of Electrical and Electronics Engineers2015

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

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

Efficient Subnetwork Selection in Relay Networks

Christina Fragouli, Siddhartha Brahma, Ayan Sengupta

We consider a source that would like to communicate with a destination over a layered Gaussian relay network. We present a computationally efficient method that enables to select a near-optimal (in terms of throughput) subnetwork of a given size connecting ...

2014

Maximizing Symmetric Submodular Functions

Graph Chatbot

Chat with Graph Search

Strengths and Limitations of Linear Programming Relaxations

Maximizing Symmetric Submodular Functions

LP-Based Algorithms For Capacitated Facility Location

Dynamic Facility Location via Exponential Clocks

Applications of Strong Convex Relaxations to Allocation Problems

Comparing genomes with rearrangements and segmental duplications

Optimal Hybrid Perimeter and Switching Plans Control for Urban Traffic Networks

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

LP-Based Algorithms for Capacitated Facility Location

Efficient Subnetwork Selection in Relay Networks

Strengths and Limitations of Linear Programming Relaxations

Maximizing Symmetric Submodular Functions

LP-Based Algorithms For Capacitated Facility Location

Applications of Strong Convex Relaxations to Allocation Problems

Dynamic Facility Location via Exponential Clocks

Optimal Hybrid Perimeter and Switching Plans Control for Urban Traffic Networks

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

LP-Based Algorithms for Capacitated Facility Location

Comparing genomes with rearrangements and segmental duplications

Efficient Subnetwork Selection in Relay Networks