Results 1  10
of
107
Greedy Is an Almost Optimal Deque
, 2015
"... In this paper we extend the geometric binary search tree (BST) model of Demaine, Harmon, Iacono, Kane, and Pǎtraşcu (DHIKP) to accommodate for insertions and deletions. Within this extended model, we study the online Greedy BST algorithm introduced by DHIKP. Greedy BST is known to be equivalent ..."
Abstract
 Add to MetaCart
to a maximally greedy (but inherently offline) algorithm introduced independently by Lucas in 1988 and Munro in 2000, conjectured to be dynamically optimal. With the application of forbiddensubmatrix theory, we prove a quasilinear upper bound on the performance of Greedy BST on deque sequences. It has
On the existence of almost greedy bases in Banach spaces
 Studia Math
, 2003
"... Abstract. We consider several greedy conditions for bases in Banach spaces that arise naturally in the study of the Thresholding Greedy Algorithm (TGA). In particular, we continue the study of almost greedy bases begun in [3]. We show that almost greedy bases are essentially optimal for nterm appro ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
Abstract. We consider several greedy conditions for bases in Banach spaces that arise naturally in the study of the Thresholding Greedy Algorithm (TGA). In particular, we continue the study of almost greedy bases begun in [3]. We show that almost greedy bases are essentially optimal for n
Price of Anarchy for Greedy Auctions
"... We study mechanisms for utilitarian combinatorial allocation problems, where agents are not assumed to be singleminded. This class of problems includes combinatorial auctions, multiunit auctions, unsplittable flow problems, and others. We focus on the problem of designing mechanisms that approximat ..."
Abstract

Cited by 30 (9 self)
 Add to MetaCart
that approximately optimize social welfare at every BayesNash equilibrium (BNE), which is the standard notion of equilibrium in settings of incomplete information. For a broad class of greedy approximation algorithms, we give a general blackbox reduction to deterministic mechanisms with almost no loss
Almost all kcolorable graphs are easy to color
 In: J. Algorithms
, 1988
"... We describe a simple and e cient heuristic algorithm for the graph coloring problem and show that for all k it nds an optimal coloring for almost all kcolorable graphs We also show that an algorithm proposed by Brelaz and justi ed on experimental grounds optimally colors almost all kcolorable gr ..."
Abstract

Cited by 72 (0 self)
 Add to MetaCart
We describe a simple and e cient heuristic algorithm for the graph coloring problem and show that for all k it nds an optimal coloring for almost all kcolorable graphs We also show that an algorithm proposed by Brelaz and justi ed on experimental grounds optimally colors almost all kcolorable
A Recursive Greedy Algorithm for Walks in Directed Graphs
 PROC. OF IEEE FOCS
, 2005
"... Given an arcweighted directed graph G = (V, A, ℓ) and a pair of nodes s, t, we seek to find an st walk of length at most B that maximizes some given function f of the set of nodes visited by the walk. The simplest case is when we seek to maximize the number of nodes visited: this is called the ori ..."
Abstract

Cited by 57 (3 self)
 Add to MetaCart
) approximation (in quasipoly time) for the group Steiner problem in undirected graphs where k is the number of groups. This improves earlier ratios [15, 19, 8] by a logarithmic factor and almost matches the inapproximability threshold on trees [20]. This connection to group Steiner trees also enables us
On Greedy Maximization of Entropy
"... Abstract Submodular function maximization is one of the key problems that arise in many machine learning tasks. Greedy selection algorithms are the proven choice to solve such problems, where prior theoretical work guarantees (1 − 1/e) approximation ratio. However, it has been empirically observed ..."
Abstract
 Add to MetaCart
that greedy selection provides almost optimal solutions in practice. The main goal of this paper is to explore and answer why the greedy selection does significantly better than the theoretical guarantee of (1 − 1/e). Applications include, but are not limited to, sensor selection tasks which use both entropy
Tight bounds for selfish and greedy load balancing
 ICALP 2006. LNCS
, 2006
"... Abstract. We study the load balancing problem in the context of a set of clients each wishing to run a job on a server selected among a subset of permissible servers for the particular client. We consider two different scenarios. In selfish load balancing, each client is selfish in the sense that it ..."
Abstract

Cited by 43 (6 self)
 Add to MetaCart
. This gives rise to greedy online solutions. The aim of this paper is to determine how much the quality of load balancing is affected by selfishness and greediness. We characterize almost completely the impact of selfishness and greediness in load balancing by presenting new and improved, tight or almost
(Almost) optimal coordination mechanisms for unrelated maching scheduling
 IN 18TH ACMSIAM SYMP. ON DISCRETE ALGORITHMS (SODA
, 2008
"... We investigate the influence of different algorithmic choices on the approximation ratio in selfish scheduling. Our goal is to design local policies that minimize the inefficiency of resulting equilibria. In particular, we design optimal coordination mechanisms for unrelated machine scheduling, and ..."
Abstract

Cited by 33 (6 self)
 Add to MetaCart
We investigate the influence of different algorithmic choices on the approximation ratio in selfish scheduling. Our goal is to design local policies that minimize the inefficiency of resulting equilibria. In particular, we design optimal coordination mechanisms for unrelated machine scheduling
Greedy Algorithms for Minimisation Problems in Random Regular Graphs
, 2001
"... . In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the minimum vertex cover (MVC), minimum independent dominating set (MIDS) and minimum edge dominating set (MEDS) proble ..."
Abstract

Cited by 12 (4 self)
 Add to MetaCart
) problems. In almost all cases we are able to improve the best known results for these problems. Results for the MVC problem translate immediately to results for the maximum independent set problem. We also derive lower bounds on the size of an optimal MIDS. 1
Comparing greedy and optimal coverage strategies for shallowtransfer machine translation
"... Abstract Using the opensource Apertium platform as an example of a shallowtransfer machine translation system and Spanish and Catalan data, we compare greedy (lefttoright, longestmatch) and optimalcoverage strategies when chunking the input sentence using the lefthandside patterns of shallo ..."
Abstract
 Add to MetaCart
Abstract Using the opensource Apertium platform as an example of a shallowtransfer machine translation system and Spanish and Catalan data, we compare greedy (lefttoright, longestmatch) and optimalcoverage strategies when chunking the input sentence using the lefthandside patterns
Results 1  10
of
107