{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T10:32:09Z","timestamp":1720693929183},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1991,3,1]],"date-time":"1991-03-01T00:00:00Z","timestamp":667785600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[1991,3]]},"DOI":"10.1007\/bf02115754","type":"journal-article","created":{"date-parts":[[2005,9,14]],"date-time":"2005-09-14T01:16:00Z","timestamp":1126660560000},"page":"181-197","source":"Crossref","is-referenced-by-count":6,"title":["The image of weighted combinatorial problems"],"prefix":"10.1007","volume":"33","author":[{"given":"P. M.","family":"Camerini","sequence":"first","affiliation":[]},{"given":"G.","family":"Galbiati","sequence":"additional","affiliation":[]},{"given":"F.","family":"Maffioli","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02115754_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A.V. Aho","year":"1974","unstructured":"A.V. Aho, J.E. Hopcroft and J.D. Ullman,The Design and Analysis of Computer Algorithms (Addison-Wesley, Reading, MA, 1974)."},{"key":"BF02115754_CR2","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0166-218X(87)90067-9","volume":"16","author":"F. Barahona","year":"1987","unstructured":"F. Barahona and W.R. Pulleyblank, Exact arborescences, matchings and cycles, Discr. Appl. Math. 16(1987)91\u2013100.","journal-title":"Discr. Appl. Math."},{"key":"BF02115754_CR3","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1016\/0020-0190(78)90030-3","volume":"7","author":"P.M. Camerini","year":"1978","unstructured":"P.M. Camerini, The min-max spanning tree problem and some extensions, Inform. Process. Lett. 7(1978)10\u201314.","journal-title":"Inform. Process. Lett."},{"key":"BF02115754_CR4","unstructured":"P.M. Camerini, G. Galbiati and F. Maffioli, Random pseudo-polynomial algorithms and exact problems, Internal Report No. 87-014, Politecnico di Milano (1987)."},{"key":"BF02115754_CR5","unstructured":"P.M. Camerini, G. Galbiati and F. Maffioli, Modular arithmetic and randomization for exact matroid problems,Int. Conf. on Integer Programming and Combinatorial Optimization, Waterloo, Canada (1990)."},{"key":"BF02115754_CR6","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1137\/0402002","volume":"2","author":"P.M. Camerini","year":"1989","unstructured":"P.M. Camerini and H. Hamacher, Intersection of two matroids: (condensed) border graphs and rankings, SIAM J. Discr. Math. 2(1989)16\u201327.","journal-title":"SIAM J. Discr. Math."},{"key":"BF02115754_CR7","unstructured":"P.M. Camerini and F. Maffioli, A note on most-uniform hyperarcs, Internal Report No. 83-4, Dipartimento di Elettronica, Politecnico di Milano (1983)."},{"key":"BF02115754_CR8","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0166-218X(86)90041-7","volume":"15","author":"P.M. Camerini","year":"1986","unstructured":"P.M. Camerini, F. Maffioli, S. Martello and P. Toth, Most and least uniform spanning trees, Discr. Appl. Math. 15(1986)181\u2013187.","journal-title":"Discr. Appl. Math."},{"key":"BF02115754_CR9","doi-asserted-by":"crossref","first-page":"241","DOI":"10.6028\/jres.071B.033","volume":"71","author":"J. Edmonds","year":"1967","unstructured":"J. Edmonds, System of distinct representations and linear algebra, J. Res. Nat. Bur. Standay (sect. B) 71(1967)241\u2013245.","journal-title":"J. Res. Nat. Bur. Standay"},{"key":"BF02115754_CR10","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01584082","volume":"1","author":"J. Edmonds","year":"1971","unstructured":"J. Edmonds, Matroids and the greedy algorithm, Math. Progr. 1(1971)127\u2013136.","journal-title":"Math. Progr."},{"key":"BF02115754_CR11","volume-title":"Computers and Intractability","author":"M. Garey","year":"1972","unstructured":"M. Garey and D. Johnson,Computers and Intractability (Freeman, San Francisco, 1972)."},{"key":"BF02115754_CR12","unstructured":"R.M. Karp, E. Upfal and A. Widgerson, Finding a maximum matching is in RNC,17th STOC (1985), pp. 22\u201332."},{"key":"BF02115754_CR13","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"E.L. Lawler","year":"1976","unstructured":"E.L. Lawler,Combinatorial Optimization: Networks and Matroids (Holt, Rinehart and Winston, New York, 1976)."},{"key":"BF02115754_CR14","first-page":"242","volume-title":"Fundamentals of Computation Theory 79","author":"L. Lov\u00e0sz","year":"1979","unstructured":"L. Lov\u00e0sz, On determinants, matchings and random algorithms, in:Fundamentals of Computation Theory 79 (Akademie Verlag, Berlin, 1979), pp. 242\u2013245."},{"key":"BF02115754_CR15","unstructured":"F. Maffioli, Randomization for efficient algorithms, in:Stochastics in Combinatorial Optimization ed. Andreatta, Mason and Serafini (World Scientific, 1987), pp. 52\u201357."},{"key":"BF02115754_CR16","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0167-6377(84)90061-0","volume":"3","author":"S. Martello","year":"1984","unstructured":"S. Martello, W.R. Pulleyblank, P. Toth and D. de Werra, Balanced optimization problems, Oper. Res. Lett. 3(1984)275\u2013278.","journal-title":"Oper. Res. Lett."},{"key":"BF02115754_CR17","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02579206","volume":"7","author":"K. Mulmuley","year":"1987","unstructured":"K. Mulmuley, U.V. Vazirani and V.V. Vazirani, Matching is as easy as matrix inversion, Combinatorica 7(1987)105\u2013113.","journal-title":"Combinatorica"},{"key":"BF02115754_CR18","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1145\/322217.322225","volume":"27","author":"J.T. Schwartz","year":"1980","unstructured":"J.T. Schwartz, Fast probabilistic algorithms for verification of polynomial identities, J. ACM 27(1980)701\u2013717.","journal-title":"J. ACM"},{"key":"BF02115754_CR19","doi-asserted-by":"crossref","unstructured":"M. Stallmann and H.N. Gabow, An augmenting path algorithm for the parity problem on linear matroids,Proc. 25th FOCS (1984), pp. 217\u2013228.","DOI":"10.1109\/SFCS.1984.715918"},{"key":"BF02115754_CR20","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1112\/jlms\/s1-22.2.107","volume":"22","author":"W.T. Tutte","year":"1947","unstructured":"W.T. Tutte, The factorization of linear graphs, J. London Math. Soc. 22(1947)107\u2013111.","journal-title":"J. London Math. Soc."},{"key":"BF02115754_CR21","unstructured":"D.J.A. Welsh,Matroid Theory (Academic Press, 1976)."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02115754.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02115754\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02115754","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T00:56:09Z","timestamp":1557795369000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02115754"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,3]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1991,3]]}},"alternative-id":["BF02115754"],"URL":"https:\/\/doi.org\/10.1007\/bf02115754","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,3]]}}}