Wu, J., Dai, F., Gao, M., Stojmenovic, I.: On calculating power-aware connected dominating sets for efficient routing in Ad Hoc wireless networks. Rashmisnata, A., Manjanna, B., Gautam, K.D.: Unit disk cover problem in 2D. Ran, Y.L., Zhang, Y., Zhang, Z.: Parallel approximation for partial set cover. Nieberg, T., Hurink, J.: A PTAS for the minimum dominating set problem in unit disk graphs. In: Halldórsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. Li, J., Jin, Y.: A PTAS for the weighted unit disk cover problem. Khuller, S., Vishkin, U., Young, N.: A primal-dual parallel approximation technique applied to weighted set and vertex covers. In: International Conference on Current Trends in Theory and Practice of Computer Science, vol. Joachim, K., Daniel, M., Peter, R.: Partial vs. 350 Bridge Pkwy suite 208 Redwood City, CA, United State (1992) Addison Wesley Longman Publishing Co., Inc. JáJá J.: An Introduction to Parallel Algorithms. Hunt, H.B., III., Marathe, M.V., Radhakrishnan, V., Ravi, S.S., Rosenkrantz, D.J., Stearns, R.E.: NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs. 7.8.54 HPE 3PAR Common Provisioning Group Sensor 7.8.55 HPE 3PAR. Hochbaum, D.S., Maass, W.: Approximation schemes for covering and packing problems in image processing and VLSI. This generates a graph that visualizes the different components of your total traffic. Gonzalez, T.F.: Covering a set of points in multidimensional space. In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, pp. Ghaffari, M., Haeupler, B.: A Time-optimal randomized parallel algorithm for MIS. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Gandhi, R., Khuller, S., Srinivasan, A.: Approximation algorithms for partial covering problems. ACM, New York (1996)įowler, R.J., Paterson, M.S., Tanimoto, S.L.: Optimal packing and covering in the plane are NP-complete. In: 28th International Proceedings on ACM Symposium on Theory of Computing, pp. įeige, U.: A threshold of ln \(n\) for approximating set cover. 624–633, New York (2014)ĭu, D.Z., Wang, P.J.: Connected Dominating Set: Theory and Applications. In: 46th Annual ACM Symposium on Theory of Computing, pp. 22(5), 407–419 (2012)ĭinur, I., Steurer, D.: Analytical approach to parallel repetition. SIAM (2012)Ĭlark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 49(3), 454–477 (1994)Ĭhan, T.M., Grant, E.: Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling. 9(1), 1–10 (1984)īerger, B., Rompel, J., Shor, P.W.: Efficient NC algorithms for set cover with applications to learning and geometry. Bar-Yehuda, R., Moran, S.: On approximation problems related to the independent set and vertex cover problem.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |