Abstract
In this paper, we study several graph optimization problems in which the weights of vertices or edges are variables determined by several linear constraints, including maximum matching problem under linear constraints (max-MLC), minimum perfect matching problem under linear constraints (min-PMLC), shortest path problem under linear constraints (SPLC) and vertex cover problem under linear constraints (VCLC). The objective of these problems is to decide the weights that are feasible to the linear constraints, and find the optimal solutions of corresponding graph optimization problems among all feasible choices of weights. We find that these problems are NP-hard and are hard to be approximated in general. These findings suggest us to explore various special cases of them. In particular, we show that when the number of constraints is a fixed constant, all these problems are polynomially solvable. Moreover, if the total number of distinct weights is a fixed constant, then max-MLC, min-PMLC and SPLC are polynomially solvable, and VCLC has a 2-approximation algorithm. In addition, we propose approximation algorithms for various cases of max-MLC.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Notes
All the results also hold when G is an undirected graph.
References
Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory, algorithms, and applications. Prentice Hall, New Jersey
Bar-Yehuda R, Bendel K, Freund A, Rawitz D (2004) Local ratio: a unified framework for approximation algorithms. ACM Comput Surv 36(4):422–463
Burer S, Letchford AN (2012) Non-convex mixed-integer nonlinear programming: a survey. Surv Oper Res Manag Scie 17(2):97–106
Burkard R, Dell’Amico M, Martello S (2009) Assignment problems. Society for Industrial and Applied Mathematics, Philadelphia
Du DZ, Ko KI, Hu X (2011) Design and analysis of approximation algorithms. Springer, New York
Dinur I, Safra S (2005) On the hardness of approximating minimum vertex cover. Ann Math 162(1):439–485
Dijkstra EW (1959) A note on two problems in connexion with graphs. Numer Math 1:269–271
Edmonds J (1961) A glimpse of heaven. In: Lenstra J, Kan AR, Schrijver A (eds) History of mathematical programming–a collection of personal reminiscences. Centrum Wiskunde & Informatica, Amsterdam, pp 32–54
Edmonds J (1965) Paths, trees, and flowers. Can J Math 17:449–467
Fagoyinbo I, Ajibode I (2010) Application of linear programming techniques in the effective use of resources for staff training. J Emerg Trends Eng Appl Sci 1(2):127–132
Fredman ML, Tarjan RE (1987) Fibonacci heaps and their uses in improved network optimization algorithms. J ACM 34(3):596–615
Filiol E, Franc E, Gubbioli A, Moquet B, Roblot G (2007) Combinatorial optimisation of worm propagation on an unknown network. Int J Comput Electr Autom Control Inf Eng 1:2931–2937
Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, New York
Gupta KM (2014) Application of linear programming techniques for staff training. Int J Eng Innov Technol 3(12)
Gusev VV (2020) The vertex cover game: application to transport networks. Omega 97:102
Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW, Bohlinger JD (eds) Complexity of computer computations. Springer, Boston, pp 85–103
Khot S, Regev O (2008) Vertex cover might be hard to approximate to within \(2-\epsilon \). J Comput Syst Sci 74(3):335–349
Korte B, Vygen J (2012) Combinatorial optimization: theory and algorithms, 4th edn. Springer, Berlin
Kleinberg J, Tardos É (2006) Algorithm design. Pearson Education, New York
Köppe M (2011) On the complexity of nonlinear mixed-integer optimization. In: Lee J, Leyffer S (eds) Mixed-integer nonlinear programming. IMA volumes in mathematics and its applications, vol 154. Springer, Berlin, pp 533–558
Kuhn HW (1955) The Hungarian method for the assignment problem. Naval Res Logist Q 2(1 & 2):83–97
Luenberger DG, Ye Y (2015) Linear and nonlinear programming. Springer, New York
Nip K, Wang Z, Wang Z (2016) Scheduling under linear constraints. Eur J Oper Res 253(2):290–297
Nip K, Wang Z, Wang Z (2017) Knapsack with variable weights satisfying linear constraints. J Global Optim 69(3):713–725
Papadimitriou CH, Steiglitz K (1998) Combinatorial optimization: algorithms and complexity. Courier Dover Publications, New York
Sachdeva K (2012) Applications of graphs in real-life. Int J Adv Res Comput Sci 3(1):83–97
Schrijver A (1986) Theory of linear and integer programming. Wiley, New York
Uko LU, Lutz RJ, Weisel JA (2017) An application of linear programming in performance evaluation. Acad Educ Leadersh J
Wang Z, Nip K (2017) Bin packing under linear constraints. J Comb Optim 34(5):1198–1209
Williamson DP, Shmoys DB (2011) The design of approximation algorithms. Cambridge University Press, New York
Ye Y (1997) Interior point algorithms: theory and analysis. Wiley-Interscience, New York
Zhang S, Nip K, Wang Z (2018) Related machine scheduling with machine speeds satisfying linear constraints. In DK (ed) COCOA 2018 (The 12th annual international conference on combinatorial optimization and applications ). Volume 11346 of LNCS. Springer, Switzerland, pp 314–328
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
This work has been supported by NSFC Nos. 11801589, 11771245 and 11371216. A preliminary version of this paper has appeared in Y. Li et al. (Eds.): COCOA 2019, LNCS 11949, pp. 412–424, 2019.
Rights and permissions
About this article
Cite this article
Nip, K., Shi, T. & Wang, Z. Some graph optimization problems with weights satisfying linear constraints. J Comb Optim 43, 200–225 (2022). https://doi.org/10.1007/s10878-021-00754-w
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-021-00754-w