Abstract
The concept ofimage of an integrally weighted combinatorial problem is introduced as the vector of all possible weights of feasible solutions. This preliminary work begins to explore the possible applications of this concept and to study the computational complexity of image computations. It is shown that the images of spanning trees, matroid bases, perfect matchings and, more generally, matroid parity bases can be computed in polynomial time for some "bottleneck" objective functions (such as, for instance, the maximum weight of an element), whereas (random) pseudo-polynomial time is needed when the objective function is the sum of the element weights.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A.V. Aho, J.E. Hopcroft and J.D. Ullman,The Design and Analysis of Computer Algorithms (Addison-Wesley, Reading, MA, 1974).
F. Barahona and W.R. Pulleyblank, Exact arborescences, matchings and cycles, Discr. Appl. Math. 16(1987)91–100.
P.M. Camerini, The min-max spanning tree problem and some extensions, Inform. Process. Lett. 7(1978)10–14.
P.M. Camerini, G. Galbiati and F. Maffioli, Random pseudo-polynomial algorithms and exact problems, Internal Report No. 87-014, Politecnico di Milano (1987).
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).
P.M. Camerini and H. Hamacher, Intersection of two matroids: (condensed) border graphs and rankings, SIAM J. Discr. Math. 2(1989)16–27.
P.M. Camerini and F. Maffioli, A note on most-uniform hyperarcs, Internal Report No. 83-4, Dipartimento di Elettronica, Politecnico di Milano (1983).
P.M. Camerini, F. Maffioli, S. Martello and P. Toth, Most and least uniform spanning trees, Discr. Appl. Math. 15(1986)181–187.
J. Edmonds, System of distinct representations and linear algebra, J. Res. Nat. Bur. Standay (sect. B) 71(1967)241–245.
J. Edmonds, Matroids and the greedy algorithm, Math. Progr. 1(1971)127–136.
M. Garey and D. Johnson,Computers and Intractability (Freeman, San Francisco, 1972).
R.M. Karp, E. Upfal and A. Widgerson, Finding a maximum matching is in RNC,17th STOC (1985), pp. 22–32.
E.L. Lawler,Combinatorial Optimization: Networks and Matroids (Holt, Rinehart and Winston, New York, 1976).
L. Lovàsz, On determinants, matchings and random algorithms, in:Fundamentals of Computation Theory 79 (Akademie Verlag, Berlin, 1979), pp. 242–245.
F. Maffioli, Randomization for efficient algorithms, in:Stochastics in Combinatorial Optimization ed. Andreatta, Mason and Serafini (World Scientific, 1987), pp. 52–57.
S. Martello, W.R. Pulleyblank, P. Toth and D. de Werra, Balanced optimization problems, Oper. Res. Lett. 3(1984)275–278.
K. Mulmuley, U.V. Vazirani and V.V. Vazirani, Matching is as easy as matrix inversion, Combinatorica 7(1987)105–113.
J.T. Schwartz, Fast probabilistic algorithms for verification of polynomial identities, J. ACM 27(1980)701–717.
M. Stallmann and H.N. Gabow, An augmenting path algorithm for the parity problem on linear matroids,Proc. 25th FOCS (1984), pp. 217–228.
W.T. Tutte, The factorization of linear graphs, J. London Math. Soc. 22(1947)107–111.
D.J.A. Welsh,Matroid Theory (Academic Press, 1976).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Camerini, P.M., Galbiati, G. & Maffioli, F. The image of weighted combinatorial problems. Ann Oper Res 33, 181–197 (1991). https://doi.org/10.1007/BF02115754
Issue Date:
DOI: https://doi.org/10.1007/BF02115754