Literatura académica sobre el tema "Geometric Covering and Packing"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas sobre el tema "Geometric Covering and Packing".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Artículos de revistas sobre el tema "Geometric Covering and Packing"
Chan, Timothy M. y Elyot Grant. "Exact algorithms and APX-hardness results for geometric packing and covering problems". Computational Geometry 47, n.º 2 (febrero de 2014): 112–24. http://dx.doi.org/10.1016/j.comgeo.2012.04.001.
Texto completoAshok, Pradeesha, Aniket Basu Roy y Sathish Govindarajan. "Local search strikes again: PTAS for variants of geometric covering and packing". Journal of Combinatorial Optimization 39, n.º 2 (21 de junio de 2019): 618–35. http://dx.doi.org/10.1007/s10878-019-00432-y.
Texto completoKlevanskiy, Nikolay N., Sergey I. Tkachev, Ludmila A. Voloshchuk, Rouslan B. Nourgaziev y Vladimir S. Mavzovin. "Regular Two-Dimensional Packing of Congruent Objects: Cognitive Analysis of Honeycomb Constructions". Applied Sciences 11, n.º 11 (31 de mayo de 2021): 5128. http://dx.doi.org/10.3390/app11115128.
Texto completoTyrin, Grigory y Vladimir Frolovsky. "Research and application of the crow search algorithm for geometric covering optimization problems". Proceedings of the Russian higher school Academy of sciences, n.º 1 (8 de julio de 2021): 54–61. http://dx.doi.org/10.17212/1727-2769-2021-1-54-61.
Texto completoFejes Tóth, G., P. Gritzmann y J. M. Wills. "Finite sphere packing and sphere covering". Discrete & Computational Geometry 4, n.º 1 (enero de 1989): 19–40. http://dx.doi.org/10.1007/bf02187713.
Texto completoSwanepoel, Konrad J. "Simultaneous Packing and Covering in Sequence Spaces". Discrete & Computational Geometry 42, n.º 2 (7 de mayo de 2009): 335–40. http://dx.doi.org/10.1007/s00454-009-9189-8.
Texto completoMATTILA, PERTTI y R. DANIEL MAULDIN. "Measure and dimension functions: measurability and densities". Mathematical Proceedings of the Cambridge Philosophical Society 121, n.º 1 (enero de 1997): 81–100. http://dx.doi.org/10.1017/s0305004196001089.
Texto completoGroemer, H. "Some basic properties of packing and covering constants". Discrete & Computational Geometry 1, n.º 2 (junio de 1986): 183–93. http://dx.doi.org/10.1007/bf02187693.
Texto completoBöröczky, Károly. "Finite packing and covering by congruent convex domains". Discrete & Computational Geometry 30, n.º 2 (10 de julio de 2003): 185–93. http://dx.doi.org/10.1007/s00454-003-0005-8.
Texto completoSchurmann, Achill y Frank Vallentin. "Computational Approaches to Lattice Packing and Covering Problems". Discrete & Computational Geometry 35, n.º 1 (12 de octubre de 2005): 73–116. http://dx.doi.org/10.1007/s00454-005-1202-2.
Texto completoTesis sobre el tema "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/.
Texto completoBezdek, Andras. "Packing and covering problems /". The Ohio State University, 1986. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487266691095136.
Texto completoChen, Zhibin y 陳智斌. "On various packing and covering problems". Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2009. http://hub.hku.hk/bib/B43085520.
Texto completoChen, Zhibin. "On various packing and covering problems". Click to view the E-thesis via HKUTO, 2009. http://sunzi.lib.hku.hk/hkuto/record/B43085520.
Texto completoNielsen, Torben Noerup. "Combinatorial Bin Packing Problems". Diss., The University of Arizona, 1985. http://hdl.handle.net/10150/187536.
Texto completoStardom, 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.
Texto completoPasha, Arfath. "Geometric bin packing algorithm for arbitrary shapes". [Gainesville, Fla.] : University of Florida, 2003. http://purl.fcla.edu/fcla/etd/UFE0000907.
Texto completoChang, 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.
Texto completo許眞眞 y 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.
Texto completoXu, 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.
Texto completoLibros sobre el tema "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.
Buscar texto completoConvegno 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.
Buscar texto completoRogers, C. A. Packing and covering. Cambridge: Cambridge University Press, 2008.
Buscar texto completoBöröczky, K. Finite packing and covering. Cambridge, UK: Cambridge University Press, 2004.
Buscar texto completoservice), SpringerLink (Online, ed. The Kepler Conjecture: The Hales-Ferguson Proof. New York, NY: Springer Science+Business Media, LLC, 2011.
Buscar texto completoCombinatorial optimization: Packing and covering. Philadelphia: Society for Industrial and Applied Mathematics, 2001.
Buscar texto completo1951-, Cohen G., ed. Covering codes. Amsterdam: Elsevier, 1997.
Buscar texto completo1943-, Itoh Yoshiaki y ebrary Inc, eds. Random sequential packing of cubes. Singapore: World Scientific, 2011.
Buscar texto completoBarg, Alexander y O. R. Musin. Discrete geometry and algebraic combinatorics. Providence, Rhode Island: American Mathematical Society, 2014.
Buscar texto completoGerardus Joannes Maria Van Wee. Covering codes, perfect codes, and codes from algebraic curves. Helmond [Netherlands]: Wibro Dissertatiedrukkerij, 1991.
Buscar texto completoCapítulos de libros sobre el tema "Geometric Covering and Packing"
Croft, Hallard T., Kenneth J. Falconer y Richard K. Guy. "Packing and Covering". En 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.
Texto completoChekuri, Chandra, Sariel Har-Peled y Kent Quanrud. "Fast LP-based Approximations for Geometric Packing and Covering Problems". En 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.
Texto completoAshok, Pradeesha, Aniket Basu Roy y Sathish Govindarajan. "Local Search Strikes Again: PTAS for Variants of Geometric Covering and Packing". En Lecture Notes in Computer Science, 25–37. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-62389-4_3.
Texto completoYakovlev, Sergiy. "Configuration Spaces of Geometric Objects with Their Applications in Packing, Layout and Covering Problems". En 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.
Texto completoBlinovsky, Volodia. "Covering and Packing". En Asymptotic Combinatorial Coding Theory, 41–61. Boston, MA: Springer US, 1997. http://dx.doi.org/10.1007/978-1-4615-6193-4_3.
Texto completoDiestel, Reinhard. "Matching Covering and Packing". En Graph Theory, 35–58. Berlin, Heidelberg: Springer Berlin Heidelberg, 2017. http://dx.doi.org/10.1007/978-3-662-53622-3_2.
Texto completoDiestel, Reinhard. "Matching Covering and Packing". En Graph Theory, 35–57. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/978-3-642-14279-6_2.
Texto completoMitchell, Joseph S. B. y Supantha Pandit. "Packing and Covering with Segments". En WALCOM: Algorithms and Computation, 198–210. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-39881-1_17.
Texto completoKarakostas, George. "Fractional Packing and Covering Problems". En Encyclopedia of Algorithms, 778–82. New York, NY: Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4939-2864-4_149.
Texto completoKarakostas, George. "Fractional Packing and Covering Problems". En Encyclopedia of Algorithms, 1–6. Berlin, Heidelberg: Springer Berlin Heidelberg, 2015. http://dx.doi.org/10.1007/978-3-642-27848-8_149-2.
Texto completoActas de conferencias sobre el tema "Geometric Covering and Packing"
Azar, Yossi, Umang Bhaskar, Lisa Fleischer y Debmalya Panigrahi. "Online Mixed Packing and Covering". En 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.
Texto completoGadouleau, Maximilien y Zhiyuan Yan. "Packing and covering properties of subspace codes". En 2009 IEEE International Symposium on Information Theory - ISIT. IEEE, 2009. http://dx.doi.org/10.1109/isit.2009.5205292.
Texto completoSrinivasan, Aravind. "Improved approximations of packing and covering problems". En the twenty-seventh annual ACM symposium. New York, New York, USA: ACM Press, 1995. http://dx.doi.org/10.1145/225058.225138.
Texto completoEne, Alina, Sariel Har-Peled y Benjamin Raichel. "Geometric packing under non-uniform constraints". En the 2012 symposuim. New York, New York, USA: ACM Press, 2012. http://dx.doi.org/10.1145/2261250.2261253.
Texto completoYoung, N. E. "Sequential and parallel algorithms for mixed packing and covering". En Proceedings 42nd IEEE Symposium on Foundations of Computer Science. IEEE, 2001. http://dx.doi.org/10.1109/sfcs.2001.959930.
Texto completoKoufogiannakis, Christos y Neal E. Young. "Beating Simplex for Fractional Packing and Covering Linear Programs". En 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07). IEEE, 2007. http://dx.doi.org/10.1109/focs.2007.4389519.
Texto completoKoufogiannakis, Christos y Neal E. Young. "Beating Simplex for Fractional Packing and Covering Linear Programs". En 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07). IEEE, 2007. http://dx.doi.org/10.1109/focs.2007.62.
Texto completoAzar, 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". En 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 2016. http://dx.doi.org/10.1109/focs.2016.24.
Texto completoBenko, Attila, Gyorgy Dosa y Zsolt Tuza. "Bin Packing/Covering with Delivery, solved with the evolution of algorithms". En 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.
Texto completoMount, David y Ruth Silverman. "Algorithms for covering and packing and applications to CAD/CAM (abstract only)". En the 15th annual conference. New York, New York, USA: ACM Press, 1987. http://dx.doi.org/10.1145/322917.323100.
Texto completoInformes sobre el tema "Geometric Covering and Packing"
Balas, E., G. Cornuejols y J. N. Hooker. Covering, Packing and Logical Inference. Fort Belvoir, VA: Defense Technical Information Center, octubre de 1993. http://dx.doi.org/10.21236/ada274314.
Texto completo