{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,17]],"date-time":"2024-05-17T12:51:33Z","timestamp":1715950293918},"reference-count":16,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1992,10,1]],"date-time":"1992-10-01T00:00:00Z","timestamp":717897600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7594,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1992,10]]},"DOI":"10.1016\/0166-218x(92)90165-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:01Z","timestamp":1027640581000},"page":"147-153","source":"Crossref","is-referenced-by-count":15,"title":["Minimum perfect bipartite matchings and spanning trees under categorization"],"prefix":"10.1016","volume":"39","author":[{"given":"Michael B.","family":"Richey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abraham P.","family":"Punnen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(92)90165-7_BIB1","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0305-0548(86)90060-2","article-title":"Bottleneck assignment problems under categorization","volume":"13","author":"Aggarwal","year":"1986","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/0166-218X(92)90165-7_BIB2","series-title":"Data Structures and Algorithms","author":"Aho","year":"1983"},{"key":"10.1016\/0166-218X(92)90165-7_BIB3","first-page":"117","article-title":"Why certain subgraph computations require only linear time","author":"Bern","year":"1985","journal-title":"Proceedings 26th Annual IEEE Symposium on Foundations of Computer Science"},{"key":"10.1016\/0166-218X(92)90165-7_BIB4","series-title":"Report 132","article-title":"Contrained partitioning problems","author":"Burkard","year":"1988"},{"key":"10.1016\/0166-218X(92)90165-7_BIB5","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0166-218X(92)90165-7_BIB6","doi-asserted-by":"crossref","unstructured":"S.K. Gupta and A.P. Punnen, Group centre and group median of a network, European J. Oper. Res., to appear.","DOI":"10.1016\/0377-2217(89)90473-6"},{"key":"10.1016\/0166-218X(92)90165-7_BIB7","unstructured":"S.K. Gupta and A.P. Punnen, Minmax linear programmes with grouped variables, Opsearch, to appear."},{"key":"10.1016\/0166-218X(92)90165-7_BIB8","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","article-title":"An n52 algorithm for maximum matchings in bipartite graphs","volume":"2","author":"Hopcroft","year":"1973","journal-title":"SIAM J. Comput"},{"key":"10.1016\/0166-218X(92)90165-7_BIB9","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0166-218X(92)90165-7_BIB10","first-page":"1093","article-title":"A polynomial algorithm in linear programming","volume":"244","author":"Khachian","year":"1979","journal-title":"Dokl. Akad. Nauk. SSSR"},{"key":"10.1016\/0166-218X(92)90165-7_BIB11","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0167-6377(85)90042-2","article-title":"On the complexity of decomposing matrices arising in satellite communications","volume":"4","author":"Rendl","year":"1985","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0166-218X(92)90165-7_BIB12","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1002\/net.3230150207","article-title":"An efficiently solvable case of the minimum weight equivalent subgraph problem","volume":"15","author":"Richey","year":"1985","journal-title":"Networks"},{"key":"10.1016\/0166-218X(92)90165-7_BIB13","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1002\/nav.3800320308","article-title":"On Finding spanning Eulerian subgraphs","volume":"32","author":"Richey","year":"1985","journal-title":"Naval Res. Logist. Quart."},{"key":"10.1016\/0166-218X(92)90165-7_BIB14","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1057\/jors.1981.99","article-title":"Some generalizations of the time minimising assignment problem","volume":"32","author":"Seshan","year":"1981","journal-title":"J. Oper. Res. Soc."},{"key":"10.1016\/0166-218X(92)90165-7_BIB15","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1145\/322326.322328","article-title":"Linear-time computability of combinatorial problems on series-parallel graphs","volume":"29","author":"Takamizawa","year":"1982","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(92)90165-7_BIB16","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1002\/net.3230130202","article-title":"Steiner trees, partial 2-trees and minimum IFI-networks","volume":"13","author":"Wald","year":"1983","journal-title":"Networks"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X92901657?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X92901657?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T02:24:11Z","timestamp":1555122251000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X92901657"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,10]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,10]]}},"alternative-id":["0166218X92901657"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(92)90165-7","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1992,10]]}}}