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)