{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:14:13Z","timestamp":1726409653856},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319687049"},{"type":"electronic","value":"9783319687056"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-68705-6_23","type":"book-chapter","created":{"date-parts":[[2017,11,1]],"date-time":"2017-11-01T02:06:22Z","timestamp":1509501982000},"page":"303-315","source":"Crossref","is-referenced-by-count":0,"title":["The Minimum Conflict-Free Row Split Problem Revisited"],"prefix":"10.1007","author":[{"given":"Ademir","family":"Hujdurovi\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edin","family":"Husi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Milani\u010d","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Romeo","family":"Rizzi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandru I.","family":"Tomescu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,11,2]]},"reference":[{"issue":"1\u20132","key":"23_CR1","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0304-3975(98)00158-3","volume":"237","author":"P Alimonti","year":"2000","unstructured":"Alimonti, P., Kann, V.: Some APX-completeness results for cubic graphs. Theoret. Comput. Sci. 237(1\u20132), 123\u2013134 (2000)","journal-title":"Theoret. Comput. Sci."},{"key":"23_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-58412-1","volume-title":"Complexity and Approximation","author":"G Ausiello","year":"1999","unstructured":"Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation. Springer, Berlin (1999). https:\/\/doi.org\/10.1007\/978-3-642-58412-1"},{"key":"23_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1007\/3-540-48481-7_44","volume-title":"Algorithms - ESA 1999","author":"J Cheriyan","year":"1999","unstructured":"Cheriyan, J., Jord\u00e1n, T., Ravi, R.: On 2-coverings and 2-packings of laminar families. In: Ne\u0161et\u0159il, J. (ed.) ESA 1999. LNCS, vol. 1643, pp. 510\u2013520. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48481-7_44"},{"key":"23_CR4","doi-asserted-by":"crossref","first-page":"161","DOI":"10.2307\/1969503","volume":"51","author":"RP Dilworth","year":"1950","unstructured":"Dilworth, R.P.: A decomposition theorem for partially ordered sets. Ann. Math. 51, 161\u2013166 (1950)","journal-title":"Ann. Math."},{"issue":"3\u20134","key":"23_CR5","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0025-5564(75)90040-1","volume":"23","author":"GF Estabrook","year":"1975","unstructured":"Estabrook, G.F., et al.: An idealized concept of the true cladistic character. Math. Biosci. 23(3\u20134), 263\u2013272 (1975)","journal-title":"Math. Biosci."},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Frank, a.: Finding minimum weighted generators of a path system. In: Contemporary Trends in Discrete Mathematics (\u0160ti\u0159\u00edn Castle, 1997), DIMACS Series in Discrete Mathematics and Theoretical Computur Science, vol. 49, pp. 129\u2013138. American Mathematical Society, Providence (1999)","DOI":"10.1090\/dimacs\/049\/07"},{"key":"23_CR7","first-page":"701","volume":"7","author":"DR Fulkerson","year":"1956","unstructured":"Fulkerson, D.R.: Note on Dilworth\u2019s decomposition theorem for partially ordered sets. Proc. Amer. Math. Soc. 7, 701\u2013702 (1956)","journal-title":"Proc. Amer. Math. Soc."},{"key":"23_CR8","first-page":"83","volume":"82","author":"HN Gabow","year":"1998","unstructured":"Gabow, H.N., Manu, K.S.: Packing algorithms for arborescences (and spanning trees) in capacitated graphs. Math. Program. 82, 83\u2013109 (1998)","journal-title":"Math. Program."},{"key":"23_CR9","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"MC Golumbic","year":"2004","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs, 2nd edn. Elsevier Science B.V., Amsterdam (2004)","edition":"2"},{"issue":"1","key":"23_CR10","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1002\/net.3230210104","volume":"21","author":"D Gusfield","year":"1991","unstructured":"Gusfield, D.: Efficient algorithms for inferring evolutionary trees. Networks 21(1), 19\u201328 (1991)","journal-title":"Networks"},{"key":"23_CR11","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology","author":"D Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997)"},{"key":"23_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/978-3-662-44753-6_27","volume-title":"Algorithms in Bioinformatics","author":"I Hajirasouliha","year":"2014","unstructured":"Hajirasouliha, I., Raphael, B.J.: Reconstructing mutational history in multiply sampled tumors using perfect phylogeny mixtures. In: Brown, D., Morgenstern, B. (eds.) WABI 2014. LNCS, vol. 8701, pp. 354\u2013367. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44753-6_27"},{"key":"23_CR13","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"JE Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Karp, R.M.: An $$n^{5\/2}$$ n 5 \/ 2 algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2, 225\u2013231 (1973)","journal-title":"SIAM J. Comput."},{"key":"23_CR14","unstructured":"Hujdurovi\u0107, A., Husi\u0107, E., Milani\u010d, M., Rizzi, R., Tomescu, A.I.: Reconstructing perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth\u2019s theorem. https:\/\/arxiv.org\/abs\/1701.05492"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Hujdurovi\u0107, A., Ka\u010dar, U., Milani\u010d, M., Ries, B., Tomescu, A.I.: Complexity and algorithms for finding a perfect phylogeny from mixed tumor samples. IEEE\/ACM Trans. Comput. Biol. Bioinform. (2017, to appear). For an extended abstract, see Proceedings of WABI 2015, LNCS 9289, pp. 80\u201392 (2015)","DOI":"10.1007\/978-3-662-48221-6_6"},{"issue":"1","key":"23_CR16","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/s004930170004","volume":"21","author":"K Jain","year":"2001","unstructured":"Jain, K.: A factor 2 approximation algorithm for the generalized Steiner network problem. Combinatorica 21(1), 39\u201360 (2001)","journal-title":"Combinatorica"},{"key":"23_CR17","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139940023","volume-title":"Genome-Scale Algorithm Design","author":"V M\u00e4kinen","year":"2015","unstructured":"M\u00e4kinen, V., Belazzougui, D., Cunial, F., Tomescu, A.I.: Genome-Scale Algorithm Design. Cambridge University Press, Cambridge (2015)"},{"issue":"4","key":"23_CR18","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1007\/s10878-007-9086-0","volume":"15","author":"LS Moonen","year":"2008","unstructured":"Moonen, L.S., Spieksma, F.C.R.: Partitioning a weighted partial order. J. Comb. Optim. 15(4), 342\u2013356 (2008)","journal-title":"J. Comb. Optim."},{"issue":"11","key":"23_CR19","doi-asserted-by":"crossref","first-page":"2004","DOI":"10.1016\/j.dam.2007.04.016","volume":"156","author":"M Sakashita","year":"2008","unstructured":"Sakashita, M., Makino, K., Fujishige, S.: Minimizing a monotone concave function with laminar covering constraints. Discrete Appl. Math. 156(11), 2004\u20132019 (2008)","journal-title":"Discrete Appl. Math."},{"key":"23_CR20","series-title":"Algorithms and Combinatorics","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Algorithms and Combinatorics, vol. 24. Springer, Berlin (2003)"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-68705-6_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,5]],"date-time":"2019-10-05T08:11:40Z","timestamp":1570263100000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-68705-6_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319687049","9783319687056"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-68705-6_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}