๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

[Lecture Notes in Computer Science] Information Theory, Combinatorics, and Search Theory Volume 7777 || A Heuristic Solution of a Cutting Problem Using Hypergraphs

โœ Scribed by Aydinian, Harout; Cicalese, Ferdinando; Deppe, Christian

Book ID
120037679
Publisher
Springer Berlin Heidelberg
Year
2013
Weight
336 KB
Category
Article
ISBN
3642368999

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

[Lecture Notes in Computer Science] Math
[Lecture Notes in Computer Science] Mathematical Foundations of Computer Science 2003 Volume 2747 || Towards a Theory of Randomized Search Heuristics
โœ Rovan, Branislav; Vojtรกลก, Peter ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Springer Berlin Heidelberg ๐ŸŒ German โš– 232 KB

This Book Constitutes The Refereed Proceedings Of The 28th International Symposium On Mathematical Foundations Of Computer Science, Mfcs 2003, Held In Bratislava, Slovakia In August 2003. The 55 Revised Full Papers Presented Together With 7 Invited Papers Were Carefully Reviewed And Selected From 13

[Lecture Notes in Computer Science] Comp
[Lecture Notes in Computer Science] Computer Science โ€“ Theory and Applications Volume 6651 || Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity
โœ Kulikov, Alexander; Vereshchagin, Nikolay ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Springer Berlin Heidelberg ๐ŸŒ English โš– 246 KB

This book constitutes the proceedings of the 6th International Computer Science Symposium in Russia, CSR 2011, held in St. Petersburg, Russia, in June 2011. The 29 papers presented were carefully reviewed and selected from 76 submissions. The scope of topics of the symposium was quite broad and cove