Tight Approximation Bounds for Greedy Frugal Coverage Algorithms

Tight Approximation Bounds for Greedy Frugal Coverage Algorithms

Bibliografske podrobnosti
Main Authors:	Caragiannis, I, Kaklamanis, C, Kyropoulou, M
Format:	Knjiga
Izdano:	2011

Podobne knjige/članki

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

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

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

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

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

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

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

The efficiency of fair division
od: Caragiannis, I, et al.
Izdano: (2011)

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

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

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

The Efficiency of Fair Division
od: Caragiannis, I, et al.
Izdano: (2012)

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

The Efficiency of Fair Division
od: Caragiannis, I, et al.
Izdano: (2009)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Unravelling Greedy Algorithms
od: Bird, R
Izdano: (1992)

Two Greedy Algorithms
od: Bird, R
Izdano: (1992)

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

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

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

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

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

Greedy algorithms and Zipf laws
od: Moran, J, et al.
Izdano: (2018)

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