Results 1  10
of
411
Greedy strikes back: Improved facility location algorithms
 Journal of Algorithms
, 1999
"... A fundamental facility location problem is to choose the location of facilities, such as industrial plants and warehouses, to minimize the cost of satisfying the demand for some commodity. There are associated costs for locating the facilities, as well as transportation costs for distributing the co ..."
Abstract

Cited by 210 (11 self)
 Add to MetaCart
]. Recently, the first constant factor approximation algorithm for this problem was obtained by Shmoys, Tardos and Aardal [16]. We show that a simple greedy heuristic combined with the algorithm by Shmoys, Tardos and Aardal, can be used to obtain an approximation guarantee of 2.408. We discuss a few variants
Greedy Algorithm:
"... A dominating set of a graph G = (V, E) is a subset S ⊆ V of the nodes such that for all nodes v ∈ V, either v ∈ S or a neighbor u of v is in S. There are many distributed applications where computing a small dominating set of the network graph is important. It is wellknown that computing a dominati ..."
Abstract
 Add to MetaCart
dominating set of minimal size is NPhard. We therefore look for approximation algorithms, that is, algorithms which produce solutions which are optimal up to a certain factor. 10.1 Sequential Greedy Algorithm In order to understand the problem, we start with a very simple sequential algorithm. We start
Greedy optimal homotopy and homology generators
 Proc. 16th Ann. ACMSIAM Symp. Discrete Algorithms
, 2005
"... Abstract We describe simple greedy algorithms to construct the shortest set of loops that generates either the fundamental group (with a given basepoint) or the first homology group (over any fixed coefficient field) of any oriented 2manifold. In particular, we show that the shortest set of loops t ..."
Abstract

Cited by 102 (11 self)
 Add to MetaCart
Abstract We describe simple greedy algorithms to construct the shortest set of loops that generates either the fundamental group (with a given basepoint) or the first homology group (over any fixed coefficient field) of any oriented 2manifold. In particular, we show that the shortest set of loops
Greedy by Choice
 In ACM SIGACTSIGMODSIGART Symposium on Principles of Database Systems
, 1992
"... to graphcomputation algorithms. Proposed solutions The greedy paradigm of algorithm design is a well known tool used for efficiently solving many classical computational problems within the framework of procedural languages. However, it is very difficult to express these algorithms within the decla ..."
Abstract

Cited by 10 (8 self)
 Add to MetaCart
to graphcomputation algorithms. Proposed solutions The greedy paradigm of algorithm design is a well known tool used for efficiently solving many classical computational problems within the framework of procedural languages. However, it is very difficult to express these algorithms within
Greedy and heuristic algorithms for codes and colorings
 IEEE TRANS. INFORM. THEORY
, 1998
"... Many of the fundamental coding problems can be represented as graph problems. These problems are often intrinsically difficult and unsolved even if the code length is relatively small. With the motivation to improve lower bounds on the sizes of constant weight codes and asymmetric codes, we suggest ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
Many of the fundamental coding problems can be represented as graph problems. These problems are often intrinsically difficult and unsolved even if the code length is relatively small. With the motivation to improve lower bounds on the sizes of constant weight codes and asymmetric codes, we suggest
Scalable Influence Maximization for Prevalent Viral Marketing in LargeScale Social Networks
"... Influence maximization, defined by Kempe, Kleinberg, and Tardos (2003), is the problem of finding a small set of seed nodes in a social network that maximizes the spread of influence under certain influence cascade models. The scalability of influence maximization is a key factor for enabling preval ..."
Abstract

Cited by 183 (14 self)
 Add to MetaCart
world and synthetic networks demonstrate that our algorithm is currently the best scalable solution to the influence maximization problem: (a) our algorithm scales beyond millionsized graphs where the greedy algorithm becomes infeasible, and (b) in all size ranges, our algorithm performs consistently well
ForwardBackward Greedy Algorithms for Atomic Norm Regularization
, 2014
"... In many signal processing applications, one aims to reconstruct a signal that has a simple representation with respect to a certain basis or frame. Fundamental elements of the basis known as “atoms ” allow us to define “atomic norms” that can be used to construct convex regularizers for the reconstr ..."
Abstract
 Add to MetaCart
In many signal processing applications, one aims to reconstruct a signal that has a simple representation with respect to a certain basis or frame. Fundamental elements of the basis known as “atoms ” allow us to define “atomic norms” that can be used to construct convex regularizers
A Note on Greedy Algorithms for Maximum Weighted Independent Set Problem
"... In this paper, we consider three simple and natural greedy algorithms for the Maximum Weighted Independent Set problem. We show that two of them output an independent set of weight P v2V (G) W (v) d(v)+1 and the other outputs an independent set of weight P v2V (G) W (v) 2 P u2N + G ( ..."
Abstract

Cited by 39 (0 self)
 Add to MetaCart
In this paper, we consider three simple and natural greedy algorithms for the Maximum Weighted Independent Set problem. We show that two of them output an independent set of weight P v2V (G) W (v) d(v)+1 and the other outputs an independent set of weight P v2V (G) W (v) 2 P u2N + G
Greedy Algorithms for Minimum Spanning Tree
, 1998
"... The glossary de nes a spanning tree for a connected graph with nonnegative weights on its edges, and one problem: nd a max weight spanning tree. Remarkably, the greedy algorithm results in a solution. Here we present similar greedy algorithms due to Prim [3] and Kruskal [2], respectively, for the p ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The glossary de nes a spanning tree for a connected graph with nonnegative weights on its edges, and one problem: nd a max weight spanning tree. Remarkably, the greedy algorithm results in a solution. Here we present similar greedy algorithms due to Prim [3] and Kruskal [2], respectively
Greedy EdgeDisjoint Paths in Complete Graphs
, 2003
"... The maximum edgedisjoint paths problem (MEDP) is one of the most classical NPhard problems. We study the approximation ratio of a simple and practical approximation algorithm, the shortestpathfirst greedy algorithm (SGA), for MEDP in complete graphs. Previously, it was known that this ratio is a ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
The maximum edgedisjoint paths problem (MEDP) is one of the most classical NPhard problems. We study the approximation ratio of a simple and practical approximation algorithm, the shortestpathfirst greedy algorithm (SGA), for MEDP in complete graphs. Previously, it was known that this ratio
Results 1  10
of
411