An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem

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.

This thesis is devoted to the derivation of a posteriori error estimates for the numerical approximation of fluids flows separated by a free surface. Based on these estimates, error indicators are introduced and adaptive algorithms are proposed to solve th ...

The dramatic evidence of climate change is making the transition to more renewable energy systems an urgent global priority. As energy planners normally look 20-50 years ahead, it is crucial to consider the key uncertainties stemming from inaccurate foreca ...

Knapsack problems give a simple framework for decision making. A classical example is the min-knapsack problem (MinKnap): choose a subset of items with minimum total cost, whose total profit is above a given threshold. While this model successfully general ...

The large potential for waste resource and heat recovery in industry has been motivating research toward increasing efficiency. Process integration methods have proven to be effective tools in improving industrial sites while decreasing their resource and ...

In this thesis we give new algorithms for two fundamental graph problems. We develop novel ways of using linear programming formulations, even exponential-sized ones, to extract structure from problem instances and to guide algorithms in making progress. S ...

The goal of the current article is to suggest a novel solar system to produce power, fresh water, and cooling. As solar energy is unavailable at nights, a novel thermal storage system (TES) based on phase change material (PCM) is used to store the required ...

Electronic sharing markets are contributing to a paradigm shift, from consuming products to accessing products. This paper studies the effects of sharing markets on the prices for new products and on product design in terms of durability. In a dynamic econ ...

This paper is devoted to the distributed complexity of finding an approximation of the maximum cut in graphs. A classical algorithm consists in letting each vertex choose its side of the cut uniformly at random. This does not require any communication and ...

The vertex cover problem is one of the most important and intensively studied combinatorial optimization problems. Khot and Regev [Khot S, Regev O (2008) Vertex cover might be hard to approximate to within 2 - epsilon. J. Comput. System Sci. 74(3): 335-349 ...

We present a factors 4/3 approximation algorithm for the problem of finding a minimum 2-edge connected spanning subgraph of a given undirected multigraph. The algorithm is based upon a reduction to a restricted class of graphs. In these graphs, the approxi ...

Directive-based programming models, such as OpenMP, OpenACC, and OmpSs, enable users to accelerate applications by using coprocessors with little effort. These devices offer significant computing power, but their use can introduce two problems: an increase ...

In recent decades, energy efficiency has become one of the key issues facing large process industries. Mounting economic, environmental and social pressure motivate energy-intensive industries to improve their efficiency. Identifying retrofit opportunities ...

An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem

Chat with Graph Search

Adaptive algorithms for two fluids flows with anisotropic finite elements and order two time discretizations

Are renewables really that expensive? The impact of uncertainty on the cost of the energy transition

On approximation algorithms and polyhedral relaxations for knapsack problems, and clustered planarity testing

Incorporating Location Aspects in Process Integration Methodology

New Graph Algorithms via Polyhedral Techniques

Exergoeconomic optimization of a solar driven system with reverse osmosis desalination unit and phase change material thermal energy storages

Strategic Durability with Sharing Markets

Local Approximation of the Maximum Cut in Regular Graphs

No Small Linear Program Approximates Vertex Cover Within a Factor 2-epsilon

A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Subgraph Problem

Exploring the interoperability of remote GPGPU virtualization using rCUDA and directive-based programming models

A heat integration method with multiple heat exchange interfaces