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
Energy efficient indexing on air
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Mobile wireless computing: challenges in data management
Communications of the ACM
Broadcast disks: data management for asymmetric communication environments
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Balancing push and pull for data broadcast
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Self-similarity in World Wide Web traffic: evidence and possible causes
IEEE/ACM Transactions on Networking (TON)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
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
A performance evaluation of hyper text transfer protocols
SIGMETRICS '99 Proceedings of the 1999 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Efficient concurrency control for broadcast environments
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
End-to-end internet packet dynamics
IEEE/ACM Transactions on Networking (TON)
New approximation techniques for some ordering problems
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Empirical investigation of the Markov reference model
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Computer networks: a systems approach
Computer networks: a systems approach
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
Pushing dependent data in clients-providers-servers systems
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
On the propagation of long-range dependence in the Internet
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
SIAM Journal on Computing
On the constancy of internet path properties
IMW '01 Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Data on Air: Organization and Access
IEEE Transactions on Knowledge and Data Engineering
Exploiting Versions for Handling Updates in Broadcast Disks
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Adaptive Data Broadcast in Hybrid Networks
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
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
Efficient Data Dissemination to Mobile Clients in E-Commerce Applications
WECWIS '01 Proceedings of the Third International Workshop on Advanced Issues of E-Commerce and Web-Based Information Systems (WECWIS '01)
Journal of Artificial Intelligence Research
Drawing directed graphs clockwise
GD'09 Proceedings of the 17th international conference on Graph Drawing
| 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 an O(√n)-approximation algorithm for directed circular arrangements. We will also conduct an experimental evaluation of our algorithms and show that a simple heuristic has the best performance in simulations based on busy Web server logs.