5410 search results - page 13 / 1082 » When to Cross Over |
TIT
2008
13 years 8 months ago
2008
We consider the problem of several users transmitting packets to a base station, and study an optimal scheduling formulation involving three communication layers, namely, the mediu...
SODA
2010
ACM
14 years 6 months ago
2010
ACM
The crossing number of a graph is the least number of pairwise edge crossings in a drawing of the graph in the plane. We provide an O(n log n) time constant factor approximation al...
SIAMCOMP
2000
13 years 8 months ago
2000
The bipartite crossing number problem is studied, and a connection between this problem and the linear arrangement problem is established. It is shown that when the arboricity is ...
WALCOM
2010
IEEE
14 years 3 months ago
2010
IEEE
Abstract. Directed graphs are commonly drawn by the Sugiyama algorithm, where crossing reduction is a crucial phase. It is done by repeated one-sided 2-level crossing minimizations...
APPROX
2004
Springer
14 years 2 months ago
2004
Springer
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...