Добірка наукової літератури з теми "Geometric Covering and Packing"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Geometric Covering and Packing".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Geometric Covering and Packing"
Chan, Timothy M., and Elyot Grant. "Exact algorithms and APX-hardness results for geometric packing and covering problems." Computational Geometry 47, no. 2 (February 2014): 112–24. http://dx.doi.org/10.1016/j.comgeo.2012.04.001.
Повний текст джерелаAshok, Pradeesha, Aniket Basu Roy, and Sathish Govindarajan. "Local search strikes again: PTAS for variants of geometric covering and packing." Journal of Combinatorial Optimization 39, no. 2 (June 21, 2019): 618–35. http://dx.doi.org/10.1007/s10878-019-00432-y.
Повний текст джерелаKlevanskiy, Nikolay N., Sergey I. Tkachev, Ludmila A. Voloshchuk, Rouslan B. Nourgaziev, and Vladimir S. Mavzovin. "Regular Two-Dimensional Packing of Congruent Objects: Cognitive Analysis of Honeycomb Constructions." Applied Sciences 11, no. 11 (May 31, 2021): 5128. http://dx.doi.org/10.3390/app11115128.
Повний текст джерелаTyrin, Grigory, and Vladimir Frolovsky. "Research and application of the crow search algorithm for geometric covering optimization problems." Proceedings of the Russian higher school Academy of sciences, no. 1 (July 8, 2021): 54–61. http://dx.doi.org/10.17212/1727-2769-2021-1-54-61.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерелаMATTILA, PERTTI, and R. DANIEL MAULDIN. "Measure and dimension functions: measurability and densities." Mathematical Proceedings of the Cambridge Philosophical Society 121, no. 1 (January 1997): 81–100. http://dx.doi.org/10.1017/s0305004196001089.
Повний текст джерелаGroemer, H. "Some basic properties of packing and covering constants." Discrete & Computational Geometry 1, no. 2 (June 1986): 183–93. http://dx.doi.org/10.1007/bf02187693.
Повний текст джерела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.
Повний текст джерелаДисертації з теми "Geometric Covering and Packing"
Song, Yongqiang. "Improved Approximation Algorithms for Geometric Packing Problems With Experimental Evaluation." Thesis, University of North Texas, 2003. https://digital.library.unt.edu/ark:/67531/metadc4355/.
Повний текст джерелаBezdek, Andras. "Packing and covering problems /." The Ohio State University, 1986. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487266691095136.
Повний текст джерелаChen, Zhibin, and 陳智斌. "On various packing and covering problems." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2009. http://hub.hku.hk/bib/B43085520.
Повний текст джерелаChen, Zhibin. "On various packing and covering problems." Click to view the E-thesis via HKUTO, 2009. http://sunzi.lib.hku.hk/hkuto/record/B43085520.
Повний текст джерелаNielsen, Torben Noerup. "Combinatorial Bin Packing Problems." Diss., The University of Arizona, 1985. http://hdl.handle.net/10150/187536.
Повний текст джерелаStardom, John. "Metaheuristics and the search for covering and packing arrays." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2001. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/MQ61608.pdf.
Повний текст джерелаPasha, Arfath. "Geometric bin packing algorithm for arbitrary shapes." [Gainesville, Fla.] : University of Florida, 2003. http://purl.fcla.edu/fcla/etd/UFE0000907.
Повний текст джерелаChang, Engder. "Neural computing for minimum set covering and gate-packing problems." Case Western Reserve University School of Graduate Studies / OhioLINK, 1993. http://rave.ohiolink.edu/etdc/view?acc_num=case1056655652.
Повний текст джерела許眞眞 and Zhenzhen Xu. "A min-max theorem on packing and covering cycles in graphs." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2002. http://hub.hku.hk/bib/B31226966.
Повний текст джерелаXu, Zhenzhen. "A min-max theorem on packing and covering cycles in graphs /." Hong Kong : University of Hong Kong, 2002. http://sunzi.lib.hku.hk/hkuto/record.jsp?B25155301.
Повний текст джерелаКниги з теми "Geometric Covering and Packing"
Convegno, italiano di geometria integrale probabilità geometriche e. corpi convessi (4th 1994 Bari Italy). IV Convegno italiano di geometria integrale, probabilità geometriche e corpi convessi: Bari, 2-5 maggio 1994. Palermo: Sede della società, 1995.
Знайти повний текст джерелаConvegno italiano di geometria integrale, probabilità geometriche e corpi convessi (5th 1995 Milan, Italy). V Convegno italiano di geometria integrale, probabilità geometriche e corpi convessi: Milano, 19-22 aprile 1995. Palermo: Sede della società, 1996.
Знайти повний текст джерелаRogers, C. A. Packing and covering. Cambridge: Cambridge University Press, 2008.
Знайти повний текст джерелаBöröczky, K. Finite packing and covering. Cambridge, UK: Cambridge University Press, 2004.
Знайти повний текст джерелаservice), SpringerLink (Online, ed. The Kepler Conjecture: The Hales-Ferguson Proof. New York, NY: Springer Science+Business Media, LLC, 2011.
Знайти повний текст джерелаCombinatorial optimization: Packing and covering. Philadelphia: Society for Industrial and Applied Mathematics, 2001.
Знайти повний текст джерела1951-, Cohen G., ed. Covering codes. Amsterdam: Elsevier, 1997.
Знайти повний текст джерела1943-, Itoh Yoshiaki, and ebrary Inc, eds. Random sequential packing of cubes. Singapore: World Scientific, 2011.
Знайти повний текст джерелаBarg, Alexander, and O. R. Musin. Discrete geometry and algebraic combinatorics. Providence, Rhode Island: American Mathematical Society, 2014.
Знайти повний текст джерелаGerardus Joannes Maria Van Wee. Covering codes, perfect codes, and codes from algebraic curves. Helmond [Netherlands]: Wibro Dissertatiedrukkerij, 1991.
Знайти повний текст джерелаЧастини книг з теми "Geometric Covering and Packing"
Croft, Hallard T., Kenneth J. Falconer, and Richard K. Guy. "Packing and Covering." In Unsolved Problems in Geometry, 107–30. New York, NY: Springer New York, 1991. http://dx.doi.org/10.1007/978-1-4612-0963-8_5.
Повний текст джерелаChekuri, Chandra, Sariel Har-Peled, and Kent Quanrud. "Fast LP-based Approximations for Geometric Packing and Covering Problems." In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1019–38. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2020. http://dx.doi.org/10.1137/1.9781611975994.62.
Повний текст джерелаAshok, Pradeesha, Aniket Basu Roy, and Sathish Govindarajan. "Local Search Strikes Again: PTAS for Variants of Geometric Covering and Packing." In Lecture Notes in Computer Science, 25–37. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-62389-4_3.
Повний текст джерелаYakovlev, Sergiy. "Configuration Spaces of Geometric Objects with Their Applications in Packing, Layout and Covering Problems." In Advances in Intelligent Systems and Computing, 122–32. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-26474-1_9.
Повний текст джерелаBlinovsky, Volodia. "Covering and Packing." In Asymptotic Combinatorial Coding Theory, 41–61. Boston, MA: Springer US, 1997. http://dx.doi.org/10.1007/978-1-4615-6193-4_3.
Повний текст джерелаDiestel, Reinhard. "Matching Covering and Packing." In Graph Theory, 35–58. Berlin, Heidelberg: Springer Berlin Heidelberg, 2017. http://dx.doi.org/10.1007/978-3-662-53622-3_2.
Повний текст джерелаDiestel, Reinhard. "Matching Covering and Packing." In Graph Theory, 35–57. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/978-3-642-14279-6_2.
Повний текст джерелаMitchell, Joseph S. B., and Supantha Pandit. "Packing and Covering with Segments." In WALCOM: Algorithms and Computation, 198–210. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-39881-1_17.
Повний текст джерелаKarakostas, George. "Fractional Packing and Covering Problems." In Encyclopedia of Algorithms, 778–82. New York, NY: Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4939-2864-4_149.
Повний текст джерелаKarakostas, George. "Fractional Packing and Covering Problems." In Encyclopedia of Algorithms, 1–6. Berlin, Heidelberg: Springer Berlin Heidelberg, 2015. http://dx.doi.org/10.1007/978-3-642-27848-8_149-2.
Повний текст джерелаТези доповідей конференцій з теми "Geometric Covering and Packing"
Azar, Yossi, Umang Bhaskar, Lisa Fleischer, and Debmalya Panigrahi. "Online Mixed Packing and Covering." In Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2013. http://dx.doi.org/10.1137/1.9781611973105.6.
Повний текст джерелаGadouleau, Maximilien, and Zhiyuan Yan. "Packing and covering properties of subspace codes." In 2009 IEEE International Symposium on Information Theory - ISIT. IEEE, 2009. http://dx.doi.org/10.1109/isit.2009.5205292.
Повний текст джерелаSrinivasan, Aravind. "Improved approximations of packing and covering problems." In the twenty-seventh annual ACM symposium. New York, New York, USA: ACM Press, 1995. http://dx.doi.org/10.1145/225058.225138.
Повний текст джерелаEne, Alina, Sariel Har-Peled, and Benjamin Raichel. "Geometric packing under non-uniform constraints." In the 2012 symposuim. New York, New York, USA: ACM Press, 2012. http://dx.doi.org/10.1145/2261250.2261253.
Повний текст джерелаYoung, N. E. "Sequential and parallel algorithms for mixed packing and covering." In Proceedings 42nd IEEE Symposium on Foundations of Computer Science. IEEE, 2001. http://dx.doi.org/10.1109/sfcs.2001.959930.
Повний текст джерелаKoufogiannakis, Christos, and Neal E. Young. "Beating Simplex for Fractional Packing and Covering Linear Programs." In 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07). IEEE, 2007. http://dx.doi.org/10.1109/focs.2007.4389519.
Повний текст джерелаKoufogiannakis, Christos, and Neal E. Young. "Beating Simplex for Fractional Packing and Covering Linear Programs." In 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07). IEEE, 2007. http://dx.doi.org/10.1109/focs.2007.62.
Повний текст джерелаAzar, Yossi, Niv Buchbinder, T.-H. Hubert Chan, Shahar Chen, Ilan Reuven Cohen, Anupam Gupta, Zhiyi Huang, et al. "Online Algorithms for Covering and Packing Problems with Convex Objectives." In 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 2016. http://dx.doi.org/10.1109/focs.2016.24.
Повний текст джерелаBenko, Attila, Gyorgy Dosa, and Zsolt Tuza. "Bin Packing/Covering with Delivery, solved with the evolution of algorithms." In 2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA). IEEE, 2010. http://dx.doi.org/10.1109/bicta.2010.5645312.
Повний текст джерелаMount, David, and Ruth Silverman. "Algorithms for covering and packing and applications to CAD/CAM (abstract only)." In the 15th annual conference. New York, New York, USA: ACM Press, 1987. http://dx.doi.org/10.1145/322917.323100.
Повний текст джерелаЗвіти організацій з теми "Geometric Covering and Packing"
Balas, E., G. Cornuejols, and J. N. Hooker. Covering, Packing and Logical Inference. Fort Belvoir, VA: Defense Technical Information Center, October 1993. http://dx.doi.org/10.21236/ada274314.
Повний текст джерела