Sciweavers

7930 search results - page 29 / 1586
» Greedy in Approximation Algorithms
Sort
View
CORR
2011
Springer
181views Education» more  CORR 2011»
13 years 2 months ago
On Isolating Points Using Disks
In this paper, we consider the problem of choosing disks (that we can think of as corresponding to wireless sensors) so that given a set of input points in the plane, there exists ...
Matt Gibson, Gaurav Kanade, Kasturi R. Varadarajan
ESA
2004
Springer
105views Algorithms» more  ESA 2004»
14 years 24 days ago
Time Dependent Multi Scheduling of Multicast
Many network applications that need to distribute content and data to a large number of clients use a hybrid scheme in which one (or more) multicast channel is used in parallel to...
Rami Cohen, Dror Rawitz, Danny Raz
ICPP
2008
IEEE
14 years 1 months ago
Fast Source Switching for Gossip-Based Peer-to-Peer Streaming
In this paper we consider gossip-based Peer-to-Peer streaming applications where multiple sources exist and they work serially. More specifically, we tackle the problem of fast s...
Zhenhua Li, Jiannong Cao, Guihai Chen, Yan Liu
ICNC
2009
Springer
14 years 2 months ago
An Improved Greedy Genetic Algorithm for Solving Travelling Salesman Problem
—Genetic algorithm (GA) is too dependent on the initial population and a lack of local search ability. In this paper, an improved greedy genetic algorithm (IGAA) is proposed to o...
Zhenchao Wang, Haibin Duan, Xiangyin Zhang
ALGORITHMICA
2010
159views more  ALGORITHMICA 2010»
13 years 7 months ago
Computing the Greedy Spanner in Near-Quadratic Time
It is well-known that the greedy algorithm produces high quality spanners and therefore is used in several applications. However, for points in d-dimensional Euclidean space, the g...
Prosenjit Bose, Paz Carmi, Mohammad Farshi, Anil M...