Approximation algorithms for channel allocation problems in broadcast networks
暂无分享,去创建一个
Rajiv Gandhi | Samir Khuller | Aravind Srinivasan | Nan Wang | S. Khuller | A. Srinivasan | Nan Wang | R. Gandhi
[1] László Lovász,et al. On the ratio of optimal integral and fractional covers , 1975, Discret. Math..
[2] Hector Garcia-Molina,et al. Efficient Query Subscription Processing in a Multicast Environment , 2000, Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073).
[3] Roger Wattenhofer,et al. Constant-time distributed dominating set approximation , 2003, PODC.
[4] Rafael Alonso,et al. Broadcast Disks: Data Management for Asymmetric Communication Environments , 1994, Mobidata.
[5] Hiroaki Ishii,et al. Approximation algorithms for scheduling problems , 2000 .
[6] Vasek Chvátal,et al. A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..
[7] Avraham Shtub,et al. Grouping components in printed circuit board assembly with limited component staging capacity and single card setup: Problem characteristics and solution procedures , 1997 .
[8] David S. Johnson,et al. Approximation algorithms for combinatorial problems , 1973, STOC.
[9] Alessandro Panconesi,et al. Nearly optimal distributed edge coloring in O (log log n ) rounds , 1997 .
[10] Lujun Jia,et al. An efficient distributed algorithm for constructing small dominating sets , 2002, Distributed Computing.
[11] Svante Janson,et al. The Deletion Method For Upper Tail Estimates , 2004, Comb..
[12] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[13] Stanley B. Zdonik,et al. “Data in your face”: push technology in perspective , 1998, SIGMOD '98.
[14] J. Wong,et al. Broadcast Delivery , 1988, Proc. IEEE.
[15] Uriel Feige,et al. The Dense k -Subgraph Problem , 2001, Algorithmica.
[16] Van H. Vu,et al. Concentration of non‐Lipschitz functions and applications , 2002, Random Struct. Algorithms.
[17] Dorit S. Hochbaum,et al. The SONET edge-partition problem , 2003, Networks.
[18] W. Hoeffding. Probability Inequalities for sums of Bounded Random Variables , 1963 .
[19] Stanley B. Zdonik,et al. A framework for scalable dissemination-based systems , 1997, OOPSLA '97.
[20] Aravind Srinivasan,et al. Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons , 2003, J. Comput. Syst. Sci..
[21] H. Chernoff. A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .
[22] Svante Janson,et al. Poisson Approximation for Large Deviations , 1990, Random Struct. Algorithms.
[23] Ian Holyer,et al. The NP-Completeness of Some Edge-Partition Problems , 1981, SIAM J. Comput..
[24] Stanley B. Zdonik,et al. Research in Data Broadcast and Dissemination , 1998, AMCP.
[25] Stanley B. Zdonik,et al. Balancing push and pull for data broadcast , 1997, SIGMOD '97.