Publications related to Greedy algorithm

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

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

Weighted Gossip: Distributed Averaging Using Non-Doubly Stochastic Matrices

Martin Vetterli, Patrick Thiran, Florence Bénézit

This paper presents a general class of gossip-based averaging algorithms, which are inspired from Uniform Gossip [1]. While Uniform Gossip works synchronously on complete graphs, weighted gossip algorithms allow asynchronous rounds and converge on any conn ...

IEEE2010

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

We obtain a 1.5-approximation algorithm for the metric uncapacitated facility location problem (UFL), which improves on the previously best known 1.52-approximation algorithm by Mahdian, Ye and Zhang. Note, that the approximability lower bound by Guha and ...

2010

An Automated, yet Interactive and Portable DB designer

Anastasia Ailamaki, Ioannis Alagiannis, Debabrata Dash

Tuning tools attempt to configure a database to achieve optimal performance for a given workload. Selecting an optimal set of physical structures is computationally hard since it involves searching a vast space of possible configurations. Commercial DBMSs ...

2010

The VPN problem with concave costs

Laura Sanità

Only recently Goyal, Olver and Shepherd (Proc. STOC, 2008) proved that the symmetric Virtual Private Network Design (sVPN) problem has the tree routing property, namely, that there always exists an optimal solution to the problem whose support is a tree. C ...

2010

Extended Navigability of Small World Networks: Exact Results and New Insights

Paolo De Los Rios, Cécile Caretta Cartozo

Navigability of networks, that is, the ability to find any given destination vertex starting from any other vertex, is crucial to their usefulness. In 2000 Kleinberg showed that optimal navigability could be achieved in small world networks provided that a ...

American Physical Society2009

Optimal Algorithms for Page Migration in Dynamic Networks

We present an extension of a classical data management subproblem, the page migration. The problem is investigated in dynamic networks, where costs of communication between different nodes may change with time. We construct asymptotically optimal online al ...

2009

Randomized network coding for UEP video delivery in overlay networks

Pascal Frossard, Nikolaos Thomos

This paper presents a receiver-driven video delivery algorithm that exploits a novel Randomized Network Coding (RNC) scheme for unequal error protection (UEP). The main idea of our approach is to account for the unequal importance of media packets in the n ...

2009

Improved successive constraint method based a posteriori error estimate for reduced basis approximation of 2D Maxwell's problem

Jan Sickmann Hesthaven, Yvon Maday

In a posteriori error analysis of reduced basis approximations to affinely parametrized partial differential equations, the construction of lower bounds for the coercivity and inf-sup stability constants is essential. In [Huynh et al., C. R. Acad. Sci. Par ...

EDP SCIENCES S A2009

Complex networks

Cécile Caretta Cartozo

The last decade has witnessed a fundamental change in the role of network theory. Side by side with the increasing relevance of interdisciplinarity, this ensemble of mathematical tools and methods has known such a success and such a wide range of different ...

EPFL2009

Greedy algorithm

Graph Chatbot

Chat with Graph Search

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

Weighted Gossip: Distributed Averaging Using Non-Doubly Stochastic Matrices

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

An Automated, yet Interactive and Portable DB designer

The VPN problem with concave costs

Extended Navigability of Small World Networks: Exact Results and New Insights

Optimal Algorithms for Page Migration in Dynamic Networks

Randomized network coding for UEP video delivery in overlay networks

Improved successive constraint method based a posteriori error estimate for reduced basis approximation of 2D Maxwell's problem

Complex networks

Extended Navigability of Small World Networks: Exact Results and New Insights

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

Randomized network coding for UEP video delivery in overlay networks

Optimal Algorithms for Page Migration in Dynamic Networks

Improved successive constraint method based a posteriori error estimate for reduced basis approximation of 2D Maxwell's problem

Complex networks

Weighted Gossip: Distributed Averaging Using Non-Doubly Stochastic Matrices

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

An Automated, yet Interactive and Portable DB designer

The VPN problem with concave costs