Статті в журналах з теми "Packing-covering"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 статей у журналах для дослідження на тему "Packing-covering".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте статті в журналах для різних дисциплін та оформлюйте правильно вашу бібліографію.
Ghosh, S. K., and P. E. Haxell. "Packing and covering tetrahedra." Discrete Applied Mathematics 161, no. 9 (June 2013): 1209–15. http://dx.doi.org/10.1016/j.dam.2010.05.027.
Chang, Gerard J., and George L. Nemhauser. "Covering, Packing and Generalized Perfection." SIAM Journal on Algebraic Discrete Methods 6, no. 1 (January 1985): 109–32. http://dx.doi.org/10.1137/0606012.
Cohen, G., I. Honkala, S. Litsyn, and P. Sole. "Long packing and covering codes." IEEE Transactions on Information Theory 43, no. 5 (1997): 1617–19. http://dx.doi.org/10.1109/18.623161.
Alon, Noga, Yair Caro, and Raphael Yuster. "Packing and covering dense graphs." Journal of Combinatorial Designs 6, no. 6 (1998): 451–72. http://dx.doi.org/10.1002/(sici)1520-6610(1998)6:6<451::aid-jcd6>3.0.co;2-e.
Hojny, Christopher. "Packing, partitioning, and covering symresacks." Discrete Applied Mathematics 283 (September 2020): 689–717. http://dx.doi.org/10.1016/j.dam.2020.03.002.
McDonald, Jessica, Gregory J. Puleo, and Craig Tennenhouse. "Packing and Covering Directed Triangles." Graphs and Combinatorics 36, no. 4 (April 11, 2020): 1059–63. http://dx.doi.org/10.1007/s00373-020-02167-8.
Lonc, Zbigniew. "Majorization, packing, covering and matroids." Discrete Mathematics 121, no. 1-3 (October 1993): 151–57. http://dx.doi.org/10.1016/0012-365x(93)90548-8.
Chee, Yeow Meng, Charles J. Colbourn, Alan C. H. Ling, and Richard M. Wilson. "Covering and packing for pairs." Journal of Combinatorial Theory, Series A 120, no. 7 (September 2013): 1440–49. http://dx.doi.org/10.1016/j.jcta.2013.04.005.
Kwon, O.-joung, and Jean-Florent Raymond. "Packing and Covering Induced Subdivisions." SIAM Journal on Discrete Mathematics 35, no. 2 (January 2021): 597–636. http://dx.doi.org/10.1137/18m1226166.
Gai, Ling, and Guochuan Zhang. "Hardness of lazy packing and covering." Operations Research Letters 37, no. 2 (March 2009): 89–92. http://dx.doi.org/10.1016/j.orl.2008.12.007.
Chen, Jianer, Henning Fernau, Peter Shaw, Jianxin Wang, and Zhibiao Yang. "Kernels for packing and covering problems." Theoretical Computer Science 790 (October 2019): 152–66. http://dx.doi.org/10.1016/j.tcs.2019.04.018.
Jana, Satyabrata, and Supantha Pandit. "Covering and packing of rectilinear subdivision." Theoretical Computer Science 840 (November 2020): 166–76. http://dx.doi.org/10.1016/j.tcs.2020.07.038.
Rödl, Vojtěch. "On a Packing and Covering Problem." European Journal of Combinatorics 6, no. 1 (March 1985): 69–78. http://dx.doi.org/10.1016/s0195-6698(85)80023-8.
Haxell, P. E. "Packing and covering triangles in graphs." Discrete Mathematics 195, no. 1-3 (January 1999): 251–54. http://dx.doi.org/10.1016/s0012-365x(98)00183-6.
Stein, Sherman. "Tiling, packing, and covering by clusters." Rocky Mountain Journal of Mathematics 16, no. 2 (June 1986): 277–322. http://dx.doi.org/10.1216/rmj-1986-16-2-277.
Conway, J. H., and S. Torquato. "Packing, tiling, and covering with tetrahedra." Proceedings of the National Academy of Sciences 103, no. 28 (July 3, 2006): 10612–17. http://dx.doi.org/10.1073/pnas.0601389103.
Graham, Niall, and Frank Harary. "Covering and packing in graphs—V." Computers & Mathematics with Applications 15, no. 4 (1988): 267–70. http://dx.doi.org/10.1016/0898-1221(88)90211-8.
Fan, Genghua, Hongbi Jiang, Ping Li, Douglas B. West, Daqing Yang, and Xuding Zhu. "Extensions of matroid covering and packing." European Journal of Combinatorics 76 (February 2019): 117–22. http://dx.doi.org/10.1016/j.ejc.2018.09.010.
Yin, Jianxing. "Cyclic Difference Packing and Covering Arrays." Designs, Codes and Cryptography 37, no. 2 (November 2005): 281–92. http://dx.doi.org/10.1007/s10623-004-3991-3.
Fejes Tóth, G., P. Gritzmann, and J. M. Wills. "Finite sphere packing and sphere covering." Discrete & Computational Geometry 4, no. 1 (January 1989): 19–40. http://dx.doi.org/10.1007/bf02187713.
Björklund, Andreas, Thore Husfeldt, Petteri Kaski, and Mikko Koivisto. "Covering and packing in linear space." Information Processing Letters 111, no. 21-22 (November 2011): 1033–36. http://dx.doi.org/10.1016/j.ipl.2011.08.002.
Jungnickel, D., and L. Storme. "Packing and Covering Groups with Subgroups." Journal of Algebra 239, no. 1 (May 2001): 191–214. http://dx.doi.org/10.1006/jabr.2000.8640.
Swanepoel, Konrad J. "Simultaneous Packing and Covering in Sequence Spaces." Discrete & Computational Geometry 42, no. 2 (May 7, 2009): 335–40. http://dx.doi.org/10.1007/s00454-009-9189-8.
Basu Roy, Aniket, Sathish Govindarajan, Rajiv Raman, and Saurabh Ray. "Packing and Covering with Non-Piercing Regions." Discrete & Computational Geometry 60, no. 2 (March 19, 2018): 471–92. http://dx.doi.org/10.1007/s00454-018-9983-2.
Weiner, Howard J. "Random Covering and Packing on the Line." Journal of Information and Optimization Sciences 6, no. 1 (January 1985): 49–73. http://dx.doi.org/10.1080/02522667.1985.10698805.
Sole, P. "Packing radius, covering radius, and dual distance." IEEE Transactions on Information Theory 41, no. 1 (1995): 268–72. http://dx.doi.org/10.1109/18.370102.
Lin, Mingen, Yang Yang, and Jinhui Xu. "On Lazy Bin Covering and Packing problems." Theoretical Computer Science 411, no. 1 (January 2010): 277–84. http://dx.doi.org/10.1016/j.tcs.2009.10.006.
Gruber, Peter M. "Lattice packing and covering of convex bodies." Proceedings of the Steklov Institute of Mathematics 275, no. 1 (December 2011): 229–38. http://dx.doi.org/10.1134/s0081543811080165.
Galtier, Jerome. "Fast approximation of matroid packing and covering." Annals of Operations Research 271, no. 2 (January 22, 2018): 575–98. http://dx.doi.org/10.1007/s10479-018-2756-8.
Topp, Jerzy, and Lutz Volkmann. "On packing and covering numbers of graphs." Discrete Mathematics 96, no. 3 (December 1991): 229–38. http://dx.doi.org/10.1016/0012-365x(91)90316-t.
Cui, Qing, Penny Haxell, and Will Ma. "Packing and Covering Triangles in Planar Graphs." Graphs and Combinatorics 25, no. 6 (December 2009): 817–24. http://dx.doi.org/10.1007/s00373-010-0881-5.
Haxell, P. E., and Y. Kohayakawa. "Packing and Covering Triangles in Tripartite Graphs." Graphs and Combinatorics 14, no. 1 (March 23, 1998): 1–10. http://dx.doi.org/10.1007/s003730050010.
Kolliopoulos, Stavros G., and Neal E. Young. "Approximation algorithms for covering/packing integer programs." Journal of Computer and System Sciences 71, no. 4 (November 2005): 495–505. http://dx.doi.org/10.1016/j.jcss.2005.05.002.
Ashley, Mary, Tanya Berger-Wolf, Piotr Berman, Wanpracha Chaovalitwongse, Bhaskar DasGupta, and Ming-Yang Kao. "On approximating four covering and packing problems." Journal of Computer and System Sciences 75, no. 5 (August 2009): 287–302. http://dx.doi.org/10.1016/j.jcss.2009.01.002.
Bárány, I., L. A. Wolsey, and J. Edmonds. "Packing and covering a tree by subtrees." Combinatorica 6, no. 3 (September 1986): 221–33. http://dx.doi.org/10.1007/bf02579383.
Frank, András, and László Szegő. "Constructive characterizations for packing and covering with trees." Discrete Applied Mathematics 131, no. 2 (September 2003): 347–71. http://dx.doi.org/10.1016/s0166-218x(02)00464-x.
Böröczky, Károly. "Finite packing and covering by congruent convex domains." Discrete & Computational Geometry 30, no. 2 (July 10, 2003): 185–93. http://dx.doi.org/10.1007/s00454-003-0005-8.
Schurmann, Achill, and Frank Vallentin. "Computational Approaches to Lattice Packing and Covering Problems." Discrete & Computational Geometry 35, no. 1 (October 12, 2005): 73–116. http://dx.doi.org/10.1007/s00454-005-1202-2.
Ismailescu, Dan, and Brian Kim. "Packing and Covering with Centrally Symmetric Convex Disks." Discrete & Computational Geometry 51, no. 2 (December 6, 2013): 495–508. http://dx.doi.org/10.1007/s00454-013-9562-5.
Chepoi, Victor, Bertrand Estellon, and Guyslain Naves. "Packing and Covering with Balls on Busemann Surfaces." Discrete & Computational Geometry 57, no. 4 (March 6, 2017): 985–1011. http://dx.doi.org/10.1007/s00454-017-9872-0.
Rademacher, Luis, Alejandro Toriello, and Juan Pablo Vielma. "On packing and covering polyhedra in infinite dimensions." Operations Research Letters 44, no. 2 (March 2016): 225–30. http://dx.doi.org/10.1016/j.orl.2016.01.005.
Engel, Konrad. "Interval Packing and Covering in the Boolean Lattice." Combinatorics, Probability and Computing 5, no. 4 (December 1996): 373–84. http://dx.doi.org/10.1017/s0963548300002121.
Gadouleau, Maximilien, and Zhiyuan Yan. "Packing and Covering Properties of Rank Metric Codes." IEEE Transactions on Information Theory 54, no. 9 (September 2008): 3873–83. http://dx.doi.org/10.1109/tit.2008.928284.
Diakonikolas, Jelena, Maryam Fazel, and Lorenzo Orecchia. "Fair Packing and Covering on a Relative Scale." SIAM Journal on Optimization 30, no. 4 (January 2020): 3284–314. http://dx.doi.org/10.1137/19m1288516.
Buchbinder, Niv, and Joseph (Seffi) Naor. "Online Primal-Dual Algorithms for Covering and Packing." Mathematics of Operations Research 34, no. 2 (May 2009): 270–86. http://dx.doi.org/10.1287/moor.1080.0363.
Gu, Xiaofeng. "Spanning Rigid Subgraph Packing and Sparse Subgraph Covering." SIAM Journal on Discrete Mathematics 32, no. 2 (January 2018): 1305–13. http://dx.doi.org/10.1137/17m1134196.
Hong, Yanmei, Xiaofeng Gu, Hong-Jian Lai, and Qinghai Liu. "Fractional spanning tree packing, forest covering and eigenvalues." Discrete Applied Mathematics 213 (November 2016): 219–23. http://dx.doi.org/10.1016/j.dam.2016.04.027.
Allen-Zhu, Zeyuan, and Lorenzo Orecchia. "Nearly linear-time packing and covering LP solvers." Mathematical Programming 175, no. 1-2 (February 14, 2018): 307–53. http://dx.doi.org/10.1007/s10107-018-1244-x.
Zong, Chuanming. "Simultaneous Packing and Covering in the Euclidean Plane." Monatshefte f�r Mathematik 134, no. 3 (January 1, 2002): 247–55. http://dx.doi.org/10.1007/s605-002-8260-3.
Bentz, Cédric, Denis Cornaz, and Bernard Ries. "Packing and covering with linear programming: A survey." European Journal of Operational Research 227, no. 3 (June 2013): 409–22. http://dx.doi.org/10.1016/j.ejor.2012.11.045.