Matches in SemOpenAlex for { <https://semopenalex.org/work/W2994170018> ?p ?o ?g. }
Showing items 1 to 87 of
87
with 100 items per page.
- W2994170018 endingPage "424" @default.
- W2994170018 startingPage "412" @default.
- W2994170018 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 the maximum matching problem under linear constraints (max-MLC), the minimum perfect matching problem under linear constraints (min-PMLC), the shortest path problem under linear constraints (SPLC) and the 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 to find the optimal solution of the graph optimization problems among all the feasible choices of weights. Even though all the original graph optimization problems can be solved in polynomial time or be approximated within a fixed constant factor, we find that these problems under linear constraints are intractable in general. In particular, we show that the max-MLC problem is NP-hard, while the min-PMLC, SPLC, VCLC problems are all NP-hard and do not even have any polynomial-time algorithms unless $$P = NP$$. These findings suggest us to explore the special cases of these problems which are tractable. Particularly, we show that when the number of constraints is a fixed constant, all these problems under linear constraints are polynomially solvable. Moreover, if there are fixed number of distinct weights, then the max-MLC, min-PMLC and SPLC are polynomially solvable, and the VCLC has 2-approximation algorithm. In addition, we propose several approximation algorithms for max-MLC." @default.
- W2994170018 created "2019-12-13" @default.
- W2994170018 creator A5014525715 @default.
- W2994170018 creator A5070822158 @default.
- W2994170018 creator A5089633440 @default.
- W2994170018 date "2019-01-01" @default.
- W2994170018 modified "2023-10-17" @default.
- W2994170018 title "Some Graph Optimization Problems with Weights Satisfying Linear Constraints" @default.
- W2994170018 cites W1528002392 @default.
- W2994170018 cites W2084224084 @default.
- W2994170018 cites W2137118456 @default.
- W2994170018 cites W2143698439 @default.
- W2994170018 cites W2169528473 @default.
- W2994170018 cites W2211598476 @default.
- W2994170018 cites W2222512263 @default.
- W2994170018 cites W2401610261 @default.
- W2994170018 cites W2618972974 @default.
- W2994170018 cites W2730861964 @default.
- W2994170018 cites W2901256135 @default.
- W2994170018 cites W4205585032 @default.
- W2994170018 cites W4233756358 @default.
- W2994170018 cites W4239749705 @default.
- W2994170018 cites W4292027170 @default.
- W2994170018 doi "https://doi.org/10.1007/978-3-030-36412-0_33" @default.
- W2994170018 hasPublicationYear "2019" @default.
- W2994170018 type Work @default.
- W2994170018 sameAs 2994170018 @default.
- W2994170018 citedByCount "2" @default.
- W2994170018 countsByYear W29941700182020 @default.
- W2994170018 countsByYear W29941700182023 @default.
- W2994170018 crossrefType "book-chapter" @default.
- W2994170018 hasAuthorship W2994170018A5014525715 @default.
- W2994170018 hasAuthorship W2994170018A5070822158 @default.
- W2994170018 hasAuthorship W2994170018A5089633440 @default.
- W2994170018 hasConcept C105795698 @default.
- W2994170018 hasConcept C11413529 @default.
- W2994170018 hasConcept C126255220 @default.
- W2994170018 hasConcept C132525143 @default.
- W2994170018 hasConcept C137836250 @default.
- W2994170018 hasConcept C148764684 @default.
- W2994170018 hasConcept C165064840 @default.
- W2994170018 hasConcept C199360897 @default.
- W2994170018 hasConcept C22590252 @default.
- W2994170018 hasConcept C2777027219 @default.
- W2994170018 hasConcept C311688 @default.
- W2994170018 hasConcept C33923547 @default.
- W2994170018 hasConcept C40687702 @default.
- W2994170018 hasConcept C41008148 @default.
- W2994170018 hasConcept C41045048 @default.
- W2994170018 hasConcept C80444323 @default.
- W2994170018 hasConcept C80899671 @default.
- W2994170018 hasConceptScore W2994170018C105795698 @default.
- W2994170018 hasConceptScore W2994170018C11413529 @default.
- W2994170018 hasConceptScore W2994170018C126255220 @default.
- W2994170018 hasConceptScore W2994170018C132525143 @default.
- W2994170018 hasConceptScore W2994170018C137836250 @default.
- W2994170018 hasConceptScore W2994170018C148764684 @default.
- W2994170018 hasConceptScore W2994170018C165064840 @default.
- W2994170018 hasConceptScore W2994170018C199360897 @default.
- W2994170018 hasConceptScore W2994170018C22590252 @default.
- W2994170018 hasConceptScore W2994170018C2777027219 @default.
- W2994170018 hasConceptScore W2994170018C311688 @default.
- W2994170018 hasConceptScore W2994170018C33923547 @default.
- W2994170018 hasConceptScore W2994170018C40687702 @default.
- W2994170018 hasConceptScore W2994170018C41008148 @default.
- W2994170018 hasConceptScore W2994170018C41045048 @default.
- W2994170018 hasConceptScore W2994170018C80444323 @default.
- W2994170018 hasConceptScore W2994170018C80899671 @default.
- W2994170018 hasLocation W29941700181 @default.
- W2994170018 hasOpenAccess W2994170018 @default.
- W2994170018 hasPrimaryLocation W29941700181 @default.
- W2994170018 hasRelatedWork W1993913882 @default.
- W2994170018 hasRelatedWork W2028468530 @default.
- W2994170018 hasRelatedWork W2057973628 @default.
- W2994170018 hasRelatedWork W2088180270 @default.
- W2994170018 hasRelatedWork W2182418108 @default.
- W2994170018 hasRelatedWork W2214141347 @default.
- W2994170018 hasRelatedWork W2810930590 @default.
- W2994170018 hasRelatedWork W2952377962 @default.
- W2994170018 hasRelatedWork W4307416302 @default.
- W2994170018 hasRelatedWork W4313227037 @default.
- W2994170018 isParatext "false" @default.
- W2994170018 isRetracted "false" @default.
- W2994170018 magId "2994170018" @default.
- W2994170018 workType "book-chapter" @default.