1101 search results - page 105 / 221 » An Algorithm for the Graph Crossing Number Problem |
127
click to vote
CDC
2009
IEEE
15 years 9 months ago
2009
IEEE
Abstract— This paper is concerned with the distributed averaging problem over a given undirected graph. To enable every vertex to compute the average of the initial numbers sitti...
153
click to vote
SODA
1998
ACM
15 years 6 months ago
1998
ACM
We present the first polylog-competitive online algorithm for the general multicast admission control and routing problem in the throughput model. The ratio of the number of reque...
123
Voted
ISAAC
2005
Springer
15 years 10 months ago
2005
Springer
Abstract We study an information-theoretic variant of the graph coloring problem in which the objective function to minimize is the entropy of the coloring. The minimum entropy of ...
140
Voted
CORR
2008
Springer
15 years 5 months ago
2008
Springer
We study ways to expedite Yates's algorithm for computing the zeta and Moebius transforms of a function defined on the subset lattice. We develop a trimmed variant of Moebius ...
115
Voted
ALGORITHMICA
2008
15 years 5 months ago
2008
Let T be a spanning tree of a graph G and S V (G) be a set of sources. The routing cost of T is the total distance from all sources to all vertices. For an edge e of T, the swap ...