Tight Approximation Bounds for Greedy Frugal Coverage Algorithms

Tight Approximation Bounds for Greedy Frugal Coverage Algorithms

Библиографические подробности
Главные авторы:	Caragiannis, I, Kaklamanis, C, Kyropoulou, M
Формат:	‌
Опубликовано:	2011

Схожие документы

Tight approximation bounds for combinatorial frugal coverage algorithms
по: Caragiannis, I, и др.
Опубликовано: (2013)

Tight approximation bounds for combinatorial frugal coverage algorithms
по: Caragiannis, I, и др.
Опубликовано: (2012)

An Improved Approximation Bound for Spanning Star Forest and Color Saving
по: Athanassopoulos, S, и др.
Опубликовано: (2009)

Limitations of Deterministic Auction Design for Correlated Bidders
по: Caragiannis, I, и др.
Опубликовано: (2013)

Limitations of deterministic auction design for correlated bidders
по: Kyropoulou, M, и др.
Опубликовано: (2016)

Bounding the inefficiency of outcomes in generalized second price auctions
по: Caragiannis, I, и др.
Опубликовано: (2014)

Bounding the inefficiency of outcomes in generalized second price auctions
по: Caragiannis, I, и др.
Опубликовано: (2014)

The efficiency of fair division
по: Caragiannis, I, и др.
Опубликовано: (2011)

On the Efficiency of Equilibria in Generalized Second Price Auctions
по: Caragiannis, I, и др.
Опубликовано: (2011)

Revenue Guarantees in Sponsored Search Auctions
по: Caragiannis, I, и др.
Опубликовано: (2012)

Revenue Guarantees in the Generalized Second Price Auction
по: Caragiannis, I, и др.
Опубликовано: (2014)

The Efficiency of Fair Division
по: Caragiannis, I, и др.
Опубликовано: (2012)

On Low−Envy Truthful Allocations
по: Caragiannis, I, и др.
Опубликовано: (2009)

The Efficiency of Fair Division
по: Caragiannis, I, и др.
Опубликовано: (2009)

Greedy Algorithms for Optimal Distribution Approximation
по: Bernhard C. Geiger, и др.
Опубликовано: (2016-07-01)

The Impact of Altruism on the Efficiency of Atomic Congestion Games
по: Caragiannis, I, и др.
Опубликовано: (2010)

Phase transitions for greedy sparse approximation algorithms
по: Tanner, J, и др.
Опубликовано: (2010)

SPARSE APPROXIMATION AND RECOVERY BY GREEDY ALGORITHMS IN BANACH SPACES
по: V. N. TEMLYAKOV
Опубликовано: (2014-05-01)

Toward Tight Approximation Bounds for Graph Diameter and Eccentricities
по: Backurs, Arturs, и др.
Опубликовано: (2022)

Tight SoS-Degree Bounds for Approximate Nash Equilibria
по: Wu, Xiaodi, и др.
Опубликовано: (2017)

Optimality of the Approximation and Learning by the Rescaled Pure Super Greedy Algorithms
по: Wenhui Zhang, и др.
Опубликовано: (2022-08-01)

Approximation Properties of the Vector Weak Rescaled Pure Greedy Algorithm
по: Xu Xu, и др.
Опубликовано: (2023-04-01)

A note on the greedy approximation algorithm for the unweighted set covering problem
Опубликовано: (2003)

A simple greedy approximation algorithm for the unit disk cover problem
по: Mahdi Imanparast, и др.
Опубликовано: (2020-02-01)

Tight Conditional Lower Bounds for Approximating Diameter in Directed Graphs
по: Dalirrooyfard, Mina, и др.
Опубликовано: (2022)

Tight Lieb–Robinson Bound for approximation ratio in quantum annealing
по: Arthur Braida, и др.
Опубликовано: (2024-04-01)

The science underlying frugal innovations should not be frugal
по: Balkrishna C. Rao
Опубликовано: (2019-05-01)

On the greedy algorithm for satisfiability
по: Koutsoupias, E, и др.
Опубликовано: (1992)

On closed-form tight bounds and approximations for the median of a gamma distribution.
по: Richard F Lyon
Опубликовано: (2021-01-01)

Frugal or Fair? The Unfulfilled Promises of Frugal Innovation
по: Mario Pansera
Опубликовано: (2018-04-01)

An Adaptive Optimizer for Measurement-Frugal Variational Algorithms
по: Jonas M. Kübler, и др.
Опубликовано: (2020-05-01)

Unravelling Greedy Algorithms
по: Bird, R
Опубликовано: (1992)

Two Greedy Algorithms
по: Bird, R
Опубликовано: (1992)

Greedy approximation of high-dimensional Ornstein-Uhlenbeck operators
по: Figueroa, L, и др.
Опубликовано: (2011)

Frugal MOOCs
по: Mariam Aman Shah, и др.
Опубликовано: (2017-09-01)

No frugal innovation without frugal evaluation: the Global IDEAL Sub-Framework
по: Bolton, WS, и др.
Опубликовано: (2024)

Greedy Algorithms for Approximating the Diameter of Machine Learning Datasets in Multidimensional Euclidean Space: Experimental Results
по: Ahmad HASSANAT
Опубликовано: (2018-12-01)

No frugal innovation without frugal evaluation: the Global IDEAL Sub-Framework
по: Jesudian Gnanaraj, и др.
Опубликовано: (2024-06-01)

Greedy algorithms and Zipf laws
по: Moran, J, и др.
Опубликовано: (2018)

On the Rate of Convergence of Greedy Algorithms
по: Vladimir Temlyakov
Опубликовано: (2023-06-01)