Tight Approximation Bounds for Greedy Frugal Coverage Algorithms

Tight Approximation Bounds for Greedy Frugal Coverage Algorithms

Dades bibliogràfiques
Autors principals:	Caragiannis, I, Kaklamanis, C, Kyropoulou, M
Format:	Llibre
Publicat:	2011

Ítems similars

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

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

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

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

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

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

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

The efficiency of fair division
per: Caragiannis, I, et al.
Publicat: (2011)

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

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

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

The Efficiency of Fair Division
per: Caragiannis, I, et al.
Publicat: (2012)

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

The Efficiency of Fair Division
per: Caragiannis, I, et al.
Publicat: (2009)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Unravelling Greedy Algorithms
per: Bird, R
Publicat: (1992)

Two Greedy Algorithms
per: Bird, R
Publicat: (1992)

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

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

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

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

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

Greedy algorithms and Zipf laws
per: Moran, J, et al.
Publicat: (2018)

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