1552 search results - page 235 / 311 » On the Complexity of Constant Propagation |
180
click to vote
SPAA
2005
ACM
16 years 12 days ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
170
click to vote
GD
2005
Springer
16 years 11 days ago
2005
Springer
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...
154
click to vote
ICALP
2005
Springer
16 years 11 days ago
2005
Springer
Abstract. In this paper we present a randomized constant factor approximation algorithm for the problem of computing the optimal cost of the metric Minimum Facility Location proble...
179
click to vote
ISAAC
2005
Springer
16 years 10 days ago
2005
Springer
A partition of a set of n items is a grouping of the items into k disjoint classes of equal size. Any partition can be modeled as a graph: the items become the vertices of the grap...
173
click to vote
CSL
2004
Springer
16 years 7 days ago
2004
Springer
Subtyping rules can be fairly complex for union types, due to interactions with other types, such as function types. Furthermore, these interactions turn out to depend on the calc...