{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:56:07Z","timestamp":1725490567728},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540410560"},{"type":"electronic","value":"9783540453567"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-45356-3_63","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T23:33:28Z","timestamp":1188344008000},"page":"641-650","source":"Crossref","is-referenced-by-count":4,"title":["A Hybrid GA for the Edge-Biconnectivity Augmentation Problem"],"prefix":"10.1007","author":[{"given":"Ivana","family":"Ljubi\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00fcnther R.","family":"Raidl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jozef","family":"Kratica","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"63_CR1","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1023\/A:1009889023408","volume":"4","author":"X. Du","year":"2000","unstructured":"Du X., Hu X., Wong C. K.: On Shortest k-Edge-Connected Steiner Networks in Metric Spaces, Journal of Combinatorial Optimization 4(1), (2000), 99\u2013107","journal-title":"Journal of Combinatorial Optimization"},{"key":"63_CR2","series-title":"Graduate Texts in Mathematics","volume-title":"Graph Theory","author":"R. Diestel","year":"2000","unstructured":"Diestel R.: Graph Theory, 2nd edition, Graduate Texts in Mathematics 173, Springer, New York, (2000)","edition":"2nd edition"},{"key":"63_CR3","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1137\/0205044","volume":"5","author":"K. P. Eswaran","year":"1979","unstructured":"Eswaran K. P., Tarjan R. E.: Augmentation Problems, SIAM Journal on Computing 5, (1979), 653\u2013665","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"63_CR4","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1137\/0210019","volume":"10","author":"G. N. Frederickson","year":"1981","unstructured":"Frederickson G. N., J\u00e1j\u00e1 J.: Approximation algorithms for several graph augmentation problems, SIAM Journal on Computing 10(2), (1981), 270\u2013283","journal-title":"SIAM Journal on Computing"},{"key":"63_CR5","unstructured":"Garey M. R., Johnson D. S.: Computers and Intractability: A Guide to the Theory of \n                    \n                      \n                    \n                    $$\n\\mathcal{N}\\mathcal{P}\n$$\n                   Completeness, Freeman, (1979)"},{"key":"63_CR6","volume-title":"Optimization and Machine Learning","author":"D. E. Goldberg","year":"1989","unstructured":"Goldberg D. E.: Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, MA, (1989)"},{"key":"63_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03822-2","volume-title":"Graphs, Networks and Algorithms","author":"D. Jungnickel","year":"1999","unstructured":"Jungnickel D.: Graphs, Networks and Algorithms, Springer, Berlin, (1999)"},{"key":"63_CR8","unstructured":"Kahn V., Crescenzi P.: A compendium of \n                    \n                      \n                    \n                    $$\n\\mathcal{N}\\mathcal{P}\n$$\n                   optimization problems, \n                    http:\/\/www.nada.kth.se\/theory\/problemlist.html\n                    \n                  , (1999)"},{"issue":"2","key":"63_CR9","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1006\/jagm.1993.1010","volume":"14","author":"S. Khuller","year":"1993","unstructured":"Khuller S., Thurimella R.: Approximation Algorithms for Graph Augmentation, Journal of Algorithms 14(2), (1993), 214\u2013225","journal-title":"Journal of Algorithms"},{"issue":"2","key":"63_CR10","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1145\/174652.174654","volume":"41","author":"S. Khuller","year":"1994","unstructured":"Khuller S., Vishkin U.: Biconnectivity Approximations and Graph Carvings, Journal of the ACM 41(2), (1994) 214\u2013235","journal-title":"Journal of the ACM"},{"key":"63_CR11","unstructured":"Khuller S.: Approximation Algorithms for Finding Highly Connected Subgraphs, in Approximation Algorithms for \n                    \n                      \n                    \n                    $$\n\\mathcal{N}\\mathcal{P}\n$$\n                  -hard problems, ed. Hochbaum D., PWS Publishing Company, (1996)"},{"issue":"2","key":"63_CR12","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1006\/jagm.1996.0052","volume":"21","author":"S. Khuller","year":"1996","unstructured":"Khuller S., Raghavachari B.: Improved Approximation Algorithms for Uniform Connectivity Problem, Journal of Algorithms 21(2), (1996), 434\u2013450","journal-title":"Journal of Algorithms"},{"issue":"3","key":"63_CR13","first-page":"271","volume":"18","author":"J. Kratica","year":"1999","unstructured":"Kratica J.: Improving Performances of the Genetic Algorithm by Caching, Computers and Artificial Intelligence 18(3), (1999), 271\u2013283","journal-title":"Computers and Artificial Intelligence"},{"key":"63_CR14","volume-title":"Parallelization of Genetic Algorithms for Solving Some $$ \\mathcal{N}\\mathcal{P} $$ -complete Problems","author":"J. Kratica","year":"2000","unstructured":"Kratica J.: Parallelization of Genetic Algorithms for Solving Some \n                    \n                      \n                    \n                    $$\n\\mathcal{N}\\mathcal{P}\n$$\n                  -complete Problems, PhD thesis (in Serbian), Faculty of Mathematics, Belgrade, (2000)"},{"key":"63_CR15","volume-title":"Application of Genetic Algorithms in Graph Connectivity Problems","author":"I. Ljubic","year":"2000","unstructured":"Ljubic I.: Application of Genetic Algorithms in Graph Connectivity Problems, MS thesis (in Serbian), Faculty of Mathematics, Belgrade, (2000)"},{"key":"63_CR16","unstructured":"Ljubic I., Kratica J.: A Genetic Algorithm for the Biconnectivity Augmentation Problem, submitted to the IEEE Congress on Evolutionary Computation, San Diego, CA, (2000)"},{"key":"63_CR17","first-page":"2","volume-title":"Proc. of the 3rd Int. Conference on Genetic Algorithms","author":"G. Syswerda","year":"1989","unstructured":"Syswerda G.: Uniform Crossover in Genetic Algorithms, Proc. of the 3rd Int. Conference on Genetic Algorithms, Morgan Kaufmann, San Mateo, Calif., (1989), 2\u20139"},{"key":"63_CR18","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R. E. Tarjan","year":"1972","unstructured":"Tarjan R. E.: Depth First Search and Linear Graph Algorithms, SIAM Journal of Computing 1, (1972), 146\u2013160","journal-title":"SIAM Journal of Computing"},{"key":"63_CR19","doi-asserted-by":"crossref","unstructured":"Tsukiyama S., Kioke K., Shirakawa I.: An Algorithm to Eliminate All Complex Triangles in a Maximal Planar Graph for Use in VLSI Floorplanning, in Algorithmic Aspects of VLSI Layout, ed. Sarrafzadeh M., Lee D. T., World Scientific Publishing, (1993)","DOI":"10.1142\/9789812794468_0011"},{"key":"63_CR20","volume-title":"Combinatorics and Graph Theory","author":"D. Veljan","year":"1989","unstructured":"Veljan D.: Combinatorics and Graph Theory, \u0160kolska knjiga, Zagreb, (1989)"},{"key":"63_CR21","unstructured":"Zhu A., Khuller S., Raghavachari B.: A Uniform Framework for Approximating Weighted Connectivity Problems, Proc. of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, (1999), 937\u2013938"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature PPSN VI"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45356-3_63","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,23]],"date-time":"2019-02-23T00:56:38Z","timestamp":1550883398000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45356-3_63"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540410560","9783540453567"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-45356-3_63","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}