198 search results - page 9 / 40 » A practical algorithm for constructing oblivious routing sch... |
JACM
2000
14 years 11 months ago
2000
We consider comparator networks M that are used repeatedly: while the output produced by M is not sorted, it is fed again into M. Sorting algorithms working in this way are called ...
129
click to vote
ICALP
1998
Springer
15 years 3 months ago
1998
Springer
Interval Routing Schemes (IRS for short) have been extensively investigated in the past years with special emphasis on shortest paths. Besides their theoretical interest, IRS have...
117
Voted
COMPGEOM
2003
ACM
15 years 4 months ago
2003
ACM
Given a scene consisting of objects, ray shooting queries answer with the first object encountered by a given ray, and are used in ray tracing and radiosity for rendering photo-r...
118
click to vote
TCAD
2008
14 years 11 months ago
2008
Given a set of pins and a set of obstacles on routing layers, a multilayer obstacle-avoiding rectilinear Steiner minimal tree (ML-OARSMT) connects these pins by rectilinear edges w...
104
click to vote
SODA
1998
ACM
15 years 29 days ago
1998
ACM
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...