Minimum Perfect Bipartite Matchings and Spanning Trees under Categorization

Abstract Network optimization problems under categorization arise when the edge set is partitioned into several sets and the objective function is optimized over each set in one sense, then among the sets in some other sense. Here we find that unlike some other problems under categorization, the minimum perfect bipartite matching and minimum spanning tree problems (under categorization) are NP-complete, even on bipartite outerplanar graphs. However for one objective function both problems can be solved in polynomial time on arbitrary graphs if the number of sets is fixed.

[1]  Charles J. Colbourn,et al.  Steiner trees, partial 2-trees, and minimum IFI networks , 1983, Networks.

[2]  Rainer E. Burkard,et al.  Constrained partitioning problems , 1990, Discret. Appl. Math..

[3]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[4]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[5]  Abraham P. Punnen,et al.  Group centre and group median of a network , 1989 .

[6]  L. Khachiyan.  Polynomial algorithms in linear programming , 1980 .

[7]  Eugene L. Lawler,et al.  Why certain subgraph computations requite only linear time , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[8]  F. Rendl.  On the complexity of decomposing matrices arising in satellite communication , 1985 .

[9]  Ronald L. Rardin,et al.  An efficiently solvable case of the minimum weight equivalent subgraph problem , 1985, Networks.

[10]  Alfred V. Aho,et al.  Data Structures and Algorithms , 1983 .

[11]  Ronald L. Rardin,et al.  On finding spanning eulerian subgraphs , 1985 .

[12]  Nobuji Saito,et al.  Linear-time computability of combinatorial problems on series-parallel graphs , 1982, JACM.

[13]  C. R. Seshan.  Some Generalisations of the Time Minimising Assignment Problem , 1981 .

[14]  Lie-Fern Hsu,et al.  Bottleneck assignment problems under categorization , 1986, Comput. Oper. Res..

[15]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[16]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .