Search Sciweavers | Sciweavers

7930 search results - page 20 / 1586

» Greedy in Approximation Algorithms

click to vote

IWPEC
2010
Springer

253views Applied Computing» more IWPEC 2010»

On the Grundy Number of a Graph

13 years 5 months ago

Download ftp-sop.inria.fr

The Grundy number of a graph G, denoted by (G), is the largest k such that G has a greedy k-colouring, that is a colouring with k colours obtained by applying the greedy algorithm ...

Frédéric Havet, Leonardo Sampaio

claim paper

Read More »

click to vote

INFOCOM
2009
IEEE

130views Communications» more INFOCOM 2009»

Routing Metric Designs for Greedy, Face and Combined-Greedy-Face Routing

14 years 2 months ago

Download www.ece.vt.edu

Abstract—Different geographic routing protocols have different requirements on routing metric designs to ensure proper operation. Combining a wrong type of routing metric with a ...

Yujun Li, Yaling Yang, Xianliang Lu

claim paper

Read More »

click to vote

ICIP
2005
IEEE

164views Image Processing» more ICIP 2005»

Greedy non-linear approximation of the plenoptic function for interactive transmission of 3D scenes

14 years 9 months ago

Download freia.dei.unipd.it

We consider an interactive browsing environment, with greedy optimization of a current view, conditioned on the availability of previously transmitted information for other (possi...

Pietro Zanuttigh, Nicola Brusco, David Taubman, Gu...

claim paper

Read More »

click to vote

SIAMDM
2008

77views more SIAMDM 2008»

Approximating the Unweighted k-Set Cover Problem: Greedy Meets Local Search

13 years 7 months ago