乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:54:06Z","timestamp":1725458046871},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642321467"},{"type":"electronic","value":"9783642321474"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32147-4_33","type":"book-chapter","created":{"date-parts":[[2012,7,5]],"date-time":"2012-07-05T07:54:50Z","timestamp":1341474890000},"page":"368-379","source":"Crossref","is-referenced-by-count":1,"title":["Exploiting a Hypergraph Model for Finding Golomb Rulers"],"prefix":"10.1007","author":[{"given":"Manuel","family":"Sorge","sequence":"first","affiliation":[]},{"given":"Hannes","family":"Moser","sequence":"additional","affiliation":[]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[]},{"given":"Mathias","family":"Weller","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"7","key":"33_CR1","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1016\/j.jcss.2009.09.002","volume":"76","author":"F.N. Abu-Khzam","year":"2010","unstructured":"Abu-Khzam, F.N.: A kernelization algorithm for d-Hitting Set. J.\u00a0Comput. System Sci.\u00a076(7), 524\u2013531 (2010)","journal-title":"J.\u00a0Comput. System Sci."},{"key":"33_CR2","doi-asserted-by":"crossref","unstructured":"Babcock, W.: Intermodulation interference in radio systems. Bell Syst. Tech. J., 63\u201373 (1953)","DOI":"10.1002\/j.1538-7305.1953.tb01422.x"},{"issue":"4","key":"33_CR3","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1109\/PROC.1977.10517","volume":"65","author":"G. Bloom","year":"1977","unstructured":"Bloom, G., Golomb, S.: Applications of numbered undirected graphs. Proc. IEEE\u00a065(4), 562\u2013570 (1977)","journal-title":"Proc. IEEE"},{"key":"33_CR4","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1109\/TAP.1974.1140732","volume":"22","author":"E. Blum","year":"1974","unstructured":"Blum, E., Biraud, F., Ribes, J.: On optimal synthetic linear arrays with applications to radioastronomy. IEEE T. Antenn. Propag.\u00a022, 108\u2013109 (1974)","journal-title":"IEEE T. Antenn. Propag."},{"key":"33_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-642-11269-0_2","volume-title":"Parameterized and Exact Computation","author":"H.L. Bodlaender","year":"2009","unstructured":"Bodlaender, H.L.: Kernelization: New Upper and Lower Bound Techniques. In: Chen, J., Fomin, F.V. (eds.) IWPEC 2009. LNCS, vol.\u00a05917, pp. 17\u201337. Springer, Heidelberg (2009)"},{"key":"33_CR6","unstructured":"Dimitromanolakis, A.: Analysis of the Golomb ruler and the Sidon set problems, and determination of large, near-optimal Golomb rulers. Master\u2019s thesis, Department of Electronic and Computer Engineering, Technical University of Crete (June 2002)"},{"key":"33_CR7","unstructured":"Distributed.net. Home page, \n \n http:\/\/www.distributed.net\/\n \n \n (accessed April 2012)"},{"issue":"1","key":"33_CR8","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1109\/18.651068","volume":"44","author":"A. Dollas","year":"1998","unstructured":"Dollas, A., Rankin, W.T., McCracken, D.: A new algorithm for Golomb ruler derivation and proof of the 19 mark ruler. IEEE T. Inform. Theory\u00a044(1), 379\u2013382 (1998)","journal-title":"IEEE T. Inform. Theory"},{"issue":"1","key":"33_CR9","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.jda.2009.08.001","volume":"8","author":"M. Dom","year":"2010","unstructured":"Dom, M., Guo, J., H\u00fcffner, F., Niedermeier, R., Truss, A.: Fixed-parameter tractability results for feedback set problems in tournaments. J.\u00a0Discrete Algorithms\u00a08(1), 76\u201386 (2010)","journal-title":"J.\u00a0Discrete Algorithms"},{"key":"33_CR10","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer (1999)","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"33_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-642-10217-2_2","volume-title":"Combinatorial Algorithms","author":"M. Fellows","year":"2009","unstructured":"Fellows, M.: Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology. In: Fiala, J., Kratochv\u00edl, J., Miller, M. (eds.) IWOCA 2009. LNCS, vol.\u00a05874, pp. 2\u201310. Springer, Heidelberg (2009)"},{"key":"33_CR12","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer (2006)"},{"issue":"1","key":"33_CR13","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/1233481.1233493","volume":"38","author":"J. Guo","year":"2007","unstructured":"Guo, J., Niedermeier, R.: Invitation to data reduction and problem kernelization. ACM SIGACT News\u00a038(1), 31\u201345 (2007)","journal-title":"ACM SIGACT News"},{"key":"33_CR14","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1016\/j.dam.2008.07.006","volume":"157","author":"C. Meyer","year":"2008","unstructured":"Meyer, C., Papakonstantinou, P.A.: On the complexity of constructing Golomb rulers. Discrete Appl. Math.\u00a0157, 738\u2013748 (2008)","journal-title":"Discrete Appl. Math."},{"key":"33_CR15","doi-asserted-by":"crossref","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press (2006)","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001"},{"key":"33_CR16","series-title":"Dagstuhl Seminar Proceedings","first-page":"17","volume-title":"Proc. 27th STACS","author":"R. Niedermeier","year":"2010","unstructured":"Niedermeier, R.: Reflections on multivariate algorithmics and problem parameterization. In: Proc. 27th STACS. Dagstuhl Seminar Proceedings, vol.\u00a05, pp. 17\u201332. IBFI Dagstuhl, Germany (2010)"},{"key":"33_CR17","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-540-24580-3_11","volume-title":"Progress in Artificial Intelligence","author":"F.B. Pereira","year":"2003","unstructured":"Pereira, F.B., Tavares, J., Costa, E.: Golomb Rulers: The Advantage of Evolution. In: Pires, F.M., Abreu, S.P. (eds.) EPIA 2003. LNCS (LNAI), vol.\u00a02902, pp. 29\u201342. Springer, Heidelberg (2003)"},{"key":"33_CR18","unstructured":"Rankin, W.T.: Optimal Golomb rulers: An exhaustive parallel search implementation. Master\u2019s thesis, Department of Electrical Engineering, Duke University, Durham, Addendum by Aviral Singh (1993)"},{"key":"33_CR19","unstructured":"Sorge, M.: Algorithmic aspects of Golomb ruler construction. Studienarbeit, Institut f\u00fcr Informatik, Friedrich-Schiller-Universit\u00e4t Jena, Germany, Available electronically, arXiv:1005.5395v2 (2010)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32147-4_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:56:09Z","timestamp":1620114969000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32147-4_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642321467","9783642321474"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32147-4_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}