The datacycle architecture for very high throughput database systems
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
UNIX network programming
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
A digital fountain approach to reliable distribution of bulk data
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
New approximation techniques for some ordering problems
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
Polynomial-time approximation scheme for data broadcast
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
SIAM Journal on Computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Divide-and-conquer approximation algorithms via spreading metrics
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Journal of Artificial Intelligence Research
The directed circular arrangement problem
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
The directed circular arrangement problem
ACM Transactions on Algorithms (TALG)
Topology configuration in hybrid EPS/OCS interconnects
Euro-Par'12 Proceedings of the 18th international conference on Parallel Processing
| Hi-index | 0.00 |
Motivated by a scheduling problem in multicast environments, we consider the problem of arranging a weighted graph around a circle so as to minimize the total weighted arc length. We describe the first polynomial-time approximation algorithms for this problem, and specifically an O(log n)-approximation algorithm for undirected circular arrangements and a 脮(log n)-approximation algorithm for directed circular arrangements. We will show that a simplification of the latter algorithm has better performance than previous heuristics on graphs obtained from a busy Web server log.