3211 search results - page 464 / 643 » On the Grundy Number of a Graph |
169
click to vote
CP
2005
Springer
16 years 11 hour ago
2005
Springer
Abstract. We present a parameterized approximation scheme for distributed combinatorial optimization problems based on dynamic programming. The algorithm is a utility propagation m...
180
click to vote
ICOIN
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. In optical networks, traffic demands often demonstrate periodic nature for which time-overlapping property can be utilized in routing and wavelength assignment (RWA). A R...
144
click to vote
PAM
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. The development of veracious models of the Internet topology has received a lot of attention in the last few years. Many proposed models are based on topologies derived f...
225
click to vote
WG
2005
Springer
15 years 12 months ago
2005
Springer
In unweighted case, approximation ratio for the independent set problem has been analyzed in terms of the graph parameters, such as the number of vertices, maximum degree, and aver...
162
click to vote
DMSN
2004
ACM
15 years 12 months ago
2004
ACM
We consider the in-network computation of approximate “big picture” summaries in bandwidth-constrained sensor networks. First we review early work on computing the Haar wavele...