{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:07:35Z","timestamp":1725570455450},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642175169"},{"type":"electronic","value":"9783642175176"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-17517-6_17","type":"book-chapter","created":{"date-parts":[[2010,12,3]],"date-time":"2010-12-03T15:13:41Z","timestamp":1291389221000},"page":"169-181","source":"Crossref","is-referenced-by-count":0,"title":["Neighbor Systems, Jump Systems, and Bisubmodular Polyhedra"],"prefix":"10.1007","author":[{"given":"Akiyoshi","family":"Shioura","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","first-page":"293","volume":"74","author":"K. Ando","year":"1996","unstructured":"Ando, K., Fujishige, S.: On structure of bisubmodular polyhedra. Math. Programming\u00a074, 293\u2013317 (1996)","journal-title":"Math. Programming"},{"key":"17_CR2","first-page":"188","volume":"37","author":"K. Ando","year":"1994","unstructured":"Ando, K., Fujishige, S., Naitoh, T.: A greedy algorithm for minimizing a separable convex function over an integral bisubmodular polyhedron. J. Oper. Res. Soc. Japan\u00a037, 188\u2013196 (1994)","journal-title":"J. Oper. Res. Soc. Japan"},{"key":"17_CR3","first-page":"362","volume":"38","author":"K. Ando","year":"1995","unstructured":"Ando, K., Fujishige, S., Naitoh, T.: A greedy algorithm for minimizing a separable convex function over a finite jump system. J. Oper. Res. Soc. Japan\u00a038, 362\u2013375 (1995)","journal-title":"J. Oper. Res. Soc. Japan"},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/0012-365X(94)00246-F","volume":"148","author":"K. Ando","year":"1996","unstructured":"Ando, K., Fujishige, S., Naitoh, T.: A characterization of bisubmodular functions. Discrete Math.\u00a0148, 299\u2013303 (1996)","journal-title":"Discrete Math."},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF02604639","volume":"38","author":"A. Bouchet","year":"1987","unstructured":"Bouchet, A.: Greedy algorithm and symmetric matroids. Math. Programming\u00a038, 147\u2013159 (1987)","journal-title":"Math. Programming"},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1137\/S0895480191222926","volume":"8","author":"A. Bouchet","year":"1995","unstructured":"Bouchet, A., Cunningham, W.H.: Delta-matroids, jump systems and bisubmodular polyhedra. SIAM J. Discrete Math.\u00a08, 17\u201332 (1995)","journal-title":"SIAM J. Discrete Math."},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0012-365X(88)90101-X","volume":"71","author":"R. Chandrasekaran","year":"1988","unstructured":"Chandrasekaran, R., Kabadi, S.N.: Pseudomatroids. Discrete Math.\u00a071, 205\u2013217 (1988)","journal-title":"Discrete Math."},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/s101070100256","volume":"91","author":"W.H. Cunningham","year":"2002","unstructured":"Cunningham, W.H.: Matching, matroids, and extensions. Math. Program.\u00a091, 515\u2013542 (2002)","journal-title":"Math. Program."},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/BF01580137","volume":"5","author":"F.D.J. Dunstan","year":"1973","unstructured":"Dunstan, F.D.J., Welsh, D.J.A.: A greedy algorithm for solving a certain class of linear programmes. Math. Programming\u00a05, 338\u2013353 (1973)","journal-title":"Math. Programming"},{"key":"17_CR10","unstructured":"Edmonds, J.: Submodular functions, matroids, and certain polyhedra. Combinatorial Structures and their Applications, pp. 69\u201387. Gordon and Breach, New York (1970)"},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF01584082","volume":"1","author":"J. Edmonds","year":"1971","unstructured":"Edmonds, J.: Matroids and the greedy algorithm. Math. Programming\u00a01, 127\u2013136 (1971)","journal-title":"Math. Programming"},{"key":"17_CR12","volume-title":"Submodular Functions and Optimization","author":"S. Fujishige","year":"2005","unstructured":"Fujishige, S.: Submodular Functions and Optimization, 2nd edn. Elsevier, Amsterdam (2005)","edition":"2"},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0377-2217(91)90300-K","volume":"54","author":"H. Groenevelt","year":"1991","unstructured":"Groenevelt, H.: Two algorithms for maximizing a separable concave function over a polymatroid feasible region. European J.\u00a0Operational Research\u00a054, 227\u2013236 (1991)","journal-title":"European J.\u00a0Operational Research"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Hartvigsen, D.: Neighbor system and the greedy algorithm (extended abstract), RIMS K\u00f4ky\u00fbroku Bessatsu (to appear, 2010)","DOI":"10.1137\/090777463"},{"key":"17_CR15","first-page":"390","volume":"19","author":"D.S. Hochbaum","year":"1994","unstructured":"Hochbaum, D.S.: Lower and upper bounds for the allocation problem and other nonlinear optimization problems. Math.\u00a0Oper.\u00a0Res.\u00a019, 390\u2013409 (1994)","journal-title":"Math.\u00a0Oper.\u00a0Res."},{"key":"17_CR16","unstructured":"Kobayashi, Y., Szabo, J., Takazawa, K.: A proof to Cunningham\u2019s conjecture on restricted subgraphs and jump systems. TR-2010-04. Egervary Research Group, Budapest (2010)"},{"key":"17_CR17","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.jctb.2008.05.001","volume":"99","author":"Y. Kobayashi","year":"2009","unstructured":"Kobayashi, Y., Takazawa, K.: Even factors, jump systems, and discrete convexity. J. Combin. Theory, Ser. B\u00a099, 139\u2013161 (2009)","journal-title":"J. Combin. Theory, Ser. B"},{"key":"17_CR18","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1006\/jctb.1997.1744","volume":"70","author":"L. Lov\u00e1sz","year":"1997","unstructured":"Lov\u00e1sz, L.: The member ship problem in jump systems. J. Combin. Theory, Ser. B\u00a070, 45\u201366 (1997)","journal-title":"J. Combin. Theory, Ser. B"},{"key":"17_CR19","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0166-218X(97)00140-6","volume":"84","author":"A. Shioura","year":"1998","unstructured":"Shioura, A.: Minimization of an M-convex function. Discrete Appl. Math.\u00a084, 215\u2013220 (1998)","journal-title":"Discrete Appl. Math."},{"key":"17_CR20","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1137\/060656899","volume":"21","author":"A. Shioura","year":"2007","unstructured":"Shioura, A., Tanaka, K.: Polynomial-time algorithms for linear and convex optimization on jump systems. SIAM J. Discrete Math.\u00a021, 504\u2013522 (2007)","journal-title":"SIAM J. Discrete Math."},{"key":"17_CR21","doi-asserted-by":"publisher","first-page":"509","DOI":"10.2307\/2371182","volume":"57","author":"H. Whitney","year":"1935","unstructured":"Whitney, H.: On the abstract properties of linear dependence. Amer. J. Math.\u00a057, 509\u2013533 (1935)","journal-title":"Amer. J. Math."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17517-6_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T15:49:28Z","timestamp":1559836168000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17517-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642175169","9783642175176"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17517-6_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}