Tight Approximation Bounds for Greedy Frugal Coverage Algorithms

Tight Approximation Bounds for Greedy Frugal Coverage Algorithms

Detalles Bibliográficos
Main Authors:	Caragiannis, I, Kaklamanis, C, Kyropoulou, M
Formato:	Libro
Publicado:	2011

Títulos similares

Tight approximation bounds for combinatorial frugal coverage algorithms
por: Caragiannis, I, et al.
Publicado: (2013)

Tight approximation bounds for combinatorial frugal coverage algorithms
por: Caragiannis, I, et al.
Publicado: (2012)

An Improved Approximation Bound for Spanning Star Forest and Color Saving
por: Athanassopoulos, S, et al.
Publicado: (2009)

Limitations of Deterministic Auction Design for Correlated Bidders
por: Caragiannis, I, et al.
Publicado: (2013)

Limitations of deterministic auction design for correlated bidders
por: Kyropoulou, M, et al.
Publicado: (2016)

Bounding the inefficiency of outcomes in generalized second price auctions
por: Caragiannis, I, et al.
Publicado: (2014)

Bounding the inefficiency of outcomes in generalized second price auctions
por: Caragiannis, I, et al.
Publicado: (2014)

The efficiency of fair division
por: Caragiannis, I, et al.
Publicado: (2011)

On the Efficiency of Equilibria in Generalized Second Price Auctions
por: Caragiannis, I, et al.
Publicado: (2011)

Revenue Guarantees in Sponsored Search Auctions
por: Caragiannis, I, et al.
Publicado: (2012)

Revenue Guarantees in the Generalized Second Price Auction
por: Caragiannis, I, et al.
Publicado: (2014)

The Efficiency of Fair Division
por: Caragiannis, I, et al.
Publicado: (2012)

On Low−Envy Truthful Allocations
por: Caragiannis, I, et al.
Publicado: (2009)

The Efficiency of Fair Division
por: Caragiannis, I, et al.
Publicado: (2009)

Greedy Algorithms for Optimal Distribution Approximation
por: Bernhard C. Geiger, et al.
Publicado: (2016-07-01)

The Impact of Altruism on the Efficiency of Atomic Congestion Games
por: Caragiannis, I, et al.
Publicado: (2010)

Phase transitions for greedy sparse approximation algorithms
por: Tanner, J, et al.
Publicado: (2010)

SPARSE APPROXIMATION AND RECOVERY BY GREEDY ALGORITHMS IN BANACH SPACES
por: V. N. TEMLYAKOV
Publicado: (2014-05-01)

Toward Tight Approximation Bounds for Graph Diameter and Eccentricities
por: Backurs, Arturs, et al.
Publicado: (2022)

Tight SoS-Degree Bounds for Approximate Nash Equilibria
por: Wu, Xiaodi, et al.
Publicado: (2017)

Optimality of the Approximation and Learning by the Rescaled Pure Super Greedy Algorithms
por: Wenhui Zhang, et al.
Publicado: (2022-08-01)

Approximation Properties of the Vector Weak Rescaled Pure Greedy Algorithm
por: Xu Xu, et al.
Publicado: (2023-04-01)

A note on the greedy approximation algorithm for the unweighted set covering problem
Publicado: (2003)

A simple greedy approximation algorithm for the unit disk cover problem
por: Mahdi Imanparast, et al.
Publicado: (2020-02-01)

Tight Conditional Lower Bounds for Approximating Diameter in Directed Graphs
por: Dalirrooyfard, Mina, et al.
Publicado: (2022)

Tight Lieb–Robinson Bound for approximation ratio in quantum annealing
por: Arthur Braida, et al.
Publicado: (2024-04-01)

The science underlying frugal innovations should not be frugal
por: Balkrishna C. Rao
Publicado: (2019-05-01)

On the greedy algorithm for satisfiability
por: Koutsoupias, E, et al.
Publicado: (1992)

On closed-form tight bounds and approximations for the median of a gamma distribution.
por: Richard F Lyon
Publicado: (2021-01-01)

Frugal or Fair? The Unfulfilled Promises of Frugal Innovation
por: Mario Pansera
Publicado: (2018-04-01)

An Adaptive Optimizer for Measurement-Frugal Variational Algorithms
por: Jonas M. Kübler, et al.
Publicado: (2020-05-01)

Unravelling Greedy Algorithms
por: Bird, R
Publicado: (1992)

Two Greedy Algorithms
por: Bird, R
Publicado: (1992)

Greedy approximation of high-dimensional Ornstein-Uhlenbeck operators
por: Figueroa, L, et al.
Publicado: (2011)

Frugal MOOCs
por: Mariam Aman Shah, et al.
Publicado: (2017-09-01)

No frugal innovation without frugal evaluation: the Global IDEAL Sub-Framework
por: Bolton, WS, et al.
Publicado: (2024)

Greedy Algorithms for Approximating the Diameter of Machine Learning Datasets in Multidimensional Euclidean Space: Experimental Results
por: Ahmad HASSANAT
Publicado: (2018-12-01)

No frugal innovation without frugal evaluation: the Global IDEAL Sub-Framework
por: Jesudian Gnanaraj, et al.
Publicado: (2024-06-01)

Greedy algorithms and Zipf laws
por: Moran, J, et al.
Publicado: (2018)

On the Rate of Convergence of Greedy Algorithms
por: Vladimir Temlyakov
Publicado: (2023-06-01)