乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T03:20:02Z","timestamp":1725852002078},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662495285"},{"type":"electronic","value":"9783662495292"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-49529-2_23","type":"book-chapter","created":{"date-parts":[[2016,3,21]],"date-time":"2016-03-21T08:09:41Z","timestamp":1458547781000},"page":"306-318","source":"Crossref","is-referenced-by-count":4,"title":["Faster Algorithms to Enumerate Hypergraph Transversals"],"prefix":"10.1007","author":[{"given":"Manfred","family":"Cochefert","sequence":"first","affiliation":[]},{"given":"Jean-Fran\u00e7ois","family":"Couturier","sequence":"additional","affiliation":[]},{"given":"Serge","family":"Gaspers","sequence":"additional","affiliation":[]},{"given":"Dieter","family":"Kratsch","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,3,22]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Cochefert, M., Couturier, J.-F., Gaspers, S., Kratsch, D.: Faster algorithms to enumerate hypergraph transversals. Technical report arxiv:1510.05093 (2015)","DOI":"10.1007\/978-3-662-49529-2_23"},{"issue":"8","key":"23_CR2","first-page":"2","volume":"487","author":"J-F Couturier","year":"2013","unstructured":"Couturier, J.-F., Heggernes, P., van \u2019t Hof, P., Kratsch, D.: Minimal dominating sets in graph classes: combinatorial bounds and enumeration. Theor. Comput. Sci. 487(8), 2\u201394 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Cygan, M., Dell, H., Lokshtanov, D., Marx, D., Nederlof, J., Okamoto, Y., Paturi, R., Saurabh, S., Wahlstr\u00f6m, M.: On problems as hard as CNF\u2013SAT. In: Proceedings of CCC, pp. 74\u201384 (2012)","DOI":"10.1109\/CCC.2012.36"},{"issue":"6","key":"23_CR4","doi-asserted-by":"publisher","first-page":"1278","DOI":"10.1137\/S0097539793250299","volume":"24","author":"T Eiter","year":"1995","unstructured":"Eiter, T., Gottlob, G.: Identifying the minimal transversals of a hypergraph and related problems. SIAM J. Comput. 24(6), 1278\u20131304 (1995)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"23_CR5","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1137\/S009753970240639X","volume":"32","author":"T Eiter","year":"2003","unstructured":"Eiter, T., Gottlob, G., Makino, K.: New results on monotone dualization and generating hypergraph transversals. SIAM J. Comput. 32(2), 514\u2013537 (2003)","journal-title":"SIAM J. Comput."},{"issue":"17\u201318","key":"23_CR6","doi-asserted-by":"publisher","first-page":"2356","DOI":"10.1016\/j.disc.2010.05.017","volume":"310","author":"KM Elbassioni","year":"2010","unstructured":"Elbassioni, K.M., Rauf, I.: Polynomial-time dualization of r-exact hypergraphs with applications in geometry. Discrete Math. 310(17\u201318), 2356\u20132363 (2010)","journal-title":"Discrete Math."},{"issue":"14","key":"23_CR7","doi-asserted-by":"publisher","first-page":"3157","DOI":"10.1080\/00207160903176868","volume":"87","author":"H Fernau","year":"2010","unstructured":"Fernau, H.: Parameterized algorithmics for d-hitting set. Int. J. Comput. Math. 87(14), 3157\u20133174 (2010)","journal-title":"Int. J. Comput. Math."},{"issue":"16\u201318","key":"23_CR8","doi-asserted-by":"publisher","first-page":"1698","DOI":"10.1016\/j.tcs.2010.01.001","volume":"411","author":"H Fernau","year":"2010","unstructured":"Fernau, H.: Parameterized algorithms for d-hitting set: the weighted case. Theor. Comput. Sci. 411(16\u201318), 1698\u20131713 (2010)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"23_CR9","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s00453-008-9199-6","volume":"57","author":"H Fernau","year":"2010","unstructured":"Fernau, H.: A top-down approach to search-trees: Improved algorithmics for 3-hitting set. Algorithmica 57(1), 97\u2013118 (2010)","journal-title":"Algorithmica"},{"issue":"7\u20139","key":"23_CR10","doi-asserted-by":"publisher","first-page":"1045","DOI":"10.1016\/j.tcs.2009.11.012","volume":"411","author":"FV Fomin","year":"2010","unstructured":"Fomin, F.V., Gaspers, S., Kratsch, D., Liedloff, M., Saurabh, S.: Iterative compression and exact algorithms. Theor. Comput. Sci. 411(7\u20139), 1045\u20131053 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Gaspers, S., Lokshtanov, D., Saurabh, S.: Exact algorithms via monotone local search. Technical report arxiv:1512.01621 (2015)","DOI":"10.1145\/2897518.2897551"},{"key":"23_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16533-7","volume-title":"Exact Exponential Algorithms","author":"FV Fomin","year":"2010","unstructured":"Fomin, F.V., Kratsch, D.: Exact Exponential Algorithms. Springer, Heidelberg (2010)"},{"issue":"3","key":"23_CR13","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1006\/jagm.1996.0062","volume":"21","author":"ML Fredman","year":"1996","unstructured":"Fredman, M.L., Khachiyan, L.: On the complexity of dualization of monotone disjunctive normal forms. J. Algorithms 21(3), 618\u2013628 (1996)","journal-title":"J. Algorithms"},{"key":"23_CR14","unstructured":"Gaspers, S.: Algorithmes exponentiels. Master\u2019s thesis, University Metz, France (2005)"},{"key":"23_CR15","volume-title":"Exponential Time Algorithms: Structures, Measures, and Bounds","author":"S Gaspers","year":"2010","unstructured":"Gaspers, S., Algorithms, E.T.: Exponential Time Algorithms: Structures, Measures, and Bounds. VDM Verlag Dr. Mueller e.K, Saarbr\u00fccken (2010)"},{"issue":"1","key":"23_CR16","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/j.jcss.2011.05.010","volume":"78","author":"S Gaspers","year":"2012","unstructured":"Gaspers, S., Sorkin, G.B.: A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between. J. Comput. Syst. Sci. 78(1), 305\u2013335 (2012)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"23_CR17","doi-asserted-by":"publisher","first-page":"836","DOI":"10.1007\/s00453-014-9875-7","volume":"72","author":"PA Golovach","year":"2015","unstructured":"Golovach, P.A., Heggernes, P., Kratsch, D., Villanger, Y.: An incremental polynomial time algorithm to enumerate all minimal edge dominating sets. Algorithmica 72(3), 836\u2013859 (2015)","journal-title":"Algorithmica"},{"issue":"4","key":"23_CR18","doi-asserted-by":"publisher","first-page":"1916","DOI":"10.1137\/120862612","volume":"28","author":"MM Kant\u00e9","year":"2014","unstructured":"Kant\u00e9, M.M., Limouzy, V., Mary, A., Nourine, L.: On the enumeration of minimal dominating sets and related notions. SIAM J. Discrete Math. 28(4), 1916\u20131929 (2014)","journal-title":"SIAM J. Discrete Math."},{"key":"23_CR19","doi-asserted-by":"crossref","unstructured":"Kant\u00e9, M.M., Limouzy, V., Mary, A., Nourine, L., Uno, T.: A polynomial delay algorithm for enumerating minimal dominating sets in chordal graphs. In: Proceedings of WG (2015)","DOI":"10.1007\/978-3-319-21840-3_37"},{"key":"23_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/978-3-319-21840-3_37","volume-title":"Algorithms and Data Structures","author":"MM Kant\u00e9","year":"2015","unstructured":"Kant\u00e9, M.M., Limouzy, V., Mary, A., Nourine, L., Uno, T.: Polynomial delay algorithm for listing minimal edge dominating sets in graphs. In: Dehne, F., Sack, J.-R., Stege, U. (eds.) WADS 2015. LNCS, vol. 9214, pp. 446\u2013457. Springer, Heidelberg (2015)"},{"key":"23_CR21","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of computer computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of computer computations, pp. 85\u2013103. Plenum Press, New York (1972)"},{"issue":"2","key":"23_CR22","doi-asserted-by":"publisher","first-page":"239","DOI":"10.7155\/jgaa.00107","volume":"9","author":"DJ Kavvadias","year":"2005","unstructured":"Kavvadias, D.J., Stavropoulos, E.C.: An efficient algorithm for the transversal hypergraph generation. J. Graph Algorithms Appl. 9(2), 239\u2013264 (2005)","journal-title":"J. Graph Algorithms Appl."},{"issue":"2","key":"23_CR23","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.tcs.2007.03.005","volume":"382","author":"L Khachiyan","year":"2007","unstructured":"Khachiyan, L., Boros, E., Elbassioni, K.M., Gurvich, V.: On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs. Theor. Comput. Sci. 382(2), 139\u2013150 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"23_CR24","unstructured":"Miller, R.E., Muller, D.E.: A problem of maximum consistent subsets. IBM Research Report RC-240, J. T. Watson Research Center (1960)"},{"key":"23_CR25","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF02760024","volume":"3","author":"JW Moon","year":"1965","unstructured":"Moon, J.W., Moser, L.: On cliques in graphs. Israel J. Math. 3, 23\u201328 (1965)","journal-title":"Israel J. Math."},{"issue":"1","key":"23_CR26","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/S1570-8667(03)00009-1","volume":"1","author":"R Niedermeier","year":"2003","unstructured":"Niedermeier, R., Rossmanith, P.: An efficient fixed-parameter algorithm for 3-hitting set. J. Discrete Algorithms 1(1), 89\u2013102 (2003)","journal-title":"J. Discrete Algorithms"},{"issue":"2","key":"23_CR27","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/j.jalgor.2004.01.001","volume":"51","author":"M Wahlstr\u00f6m","year":"2004","unstructured":"Wahlstr\u00f6m, M.: Exact algorithms for finding minimum transversals in rank-3 hypergraphs. J. Algorithms 51(2), 107\u2013121 (2004)","journal-title":"J. Algorithms"},{"key":"23_CR28","unstructured":"Wahlstr\u00f6m, M.: Algorithms, measures and upper bounds for satisfiability and related problems. Ph.D. thesis, Link\u00f6ping University, Sweden (2007)"}],"container-title":["Lecture Notes in Computer Science","LATIN 2016: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49529-2_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,15]],"date-time":"2022-06-15T19:16:05Z","timestamp":1655320565000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49529-2_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662495285","9783662495292"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49529-2_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}