Matches in SemOpenAlex for { <https://semopenalex.org/work/W2402734550> ?p ?o ?g. }
Showing items 1 to 59 of
59
with 100 items per page.
- W2402734550 endingPage "374" @default.
- W2402734550 startingPage "367" @default.
- W2402734550 abstract "Abstract In this paper, we give an algorithm to optimize the number of elementary k-flows obtained by decomposing a given k-route flow. It is known that a k-route flow can be decomposed into a linear combination of elementary k-flows, and there are many algorithms proposed for that decomposition. However, the number of elementary k-flows from those algorithms can be as large as O ( | E | ) when | E | is the number of edges in our network. As we have to reroute our flow for each elementary k-flow, it is more desirable to have a smaller number of the elementary flows in the combination. Let v be a maximum k-route flow value of our network, and h be a real number such that 0 h 1 . Denote τ h be the maximum value such that the flow value of the network is h ⋅ v , when edges with flow value less than τ h are removed. We propose an algorithm to decompose a ( v − k ⋅ τ h ⋅ O P T ) / v -fraction of a k-route flow to at most 1 1 − h ⋅ O P T elementary k-flows, when OPT is an optimal number of elementary k-flows required." @default.
- W2402734550 created "2016-06-24" @default.
- W2402734550 creator A5038811120 @default.
- W2402734550 date "2016-06-01" @default.
- W2402734550 modified "2023-09-26" @default.
- W2402734550 title "An Approximation Algorithm for Multiroute Flow Decomposition" @default.
- W2402734550 cites W2046863950 @default.
- W2402734550 cites W2082707864 @default.
- W2402734550 cites W2135291684 @default.
- W2402734550 cites W2161556771 @default.
- W2402734550 cites W2164946254 @default.
- W2402734550 cites W2018925997 @default.
- W2402734550 doi "https://doi.org/10.1016/j.endm.2016.03.048" @default.
- W2402734550 hasPublicationYear "2016" @default.
- W2402734550 type Work @default.
- W2402734550 sameAs 2402734550 @default.
- W2402734550 citedByCount "3" @default.
- W2402734550 countsByYear W24027345502015 @default.
- W2402734550 countsByYear W24027345502022 @default.
- W2402734550 crossrefType "journal-article" @default.
- W2402734550 hasAuthorship W2402734550A5038811120 @default.
- W2402734550 hasConcept C11413529 @default.
- W2402734550 hasConcept C124681953 @default.
- W2402734550 hasConcept C126255220 @default.
- W2402734550 hasConcept C148764684 @default.
- W2402734550 hasConcept C18903297 @default.
- W2402734550 hasConcept C2524010 @default.
- W2402734550 hasConcept C33923547 @default.
- W2402734550 hasConcept C38349280 @default.
- W2402734550 hasConcept C86803240 @default.
- W2402734550 hasConceptScore W2402734550C11413529 @default.
- W2402734550 hasConceptScore W2402734550C124681953 @default.
- W2402734550 hasConceptScore W2402734550C126255220 @default.
- W2402734550 hasConceptScore W2402734550C148764684 @default.
- W2402734550 hasConceptScore W2402734550C18903297 @default.
- W2402734550 hasConceptScore W2402734550C2524010 @default.
- W2402734550 hasConceptScore W2402734550C33923547 @default.
- W2402734550 hasConceptScore W2402734550C38349280 @default.
- W2402734550 hasConceptScore W2402734550C86803240 @default.
- W2402734550 hasLocation W24027345501 @default.
- W2402734550 hasOpenAccess W2402734550 @default.
- W2402734550 hasPrimaryLocation W24027345501 @default.
- W2402734550 hasRelatedWork W14353188 @default.
- W2402734550 hasRelatedWork W2020152932 @default.
- W2402734550 hasRelatedWork W2023339089 @default.
- W2402734550 hasRelatedWork W2115710456 @default.
- W2402734550 hasRelatedWork W2298446516 @default.
- W2402734550 hasRelatedWork W2965903463 @default.
- W2402734550 hasRelatedWork W4238350222 @default.
- W2402734550 hasRelatedWork W4244417643 @default.
- W2402734550 hasRelatedWork W4293483146 @default.
- W2402734550 hasRelatedWork W2462476910 @default.
- W2402734550 hasVolume "52" @default.
- W2402734550 isParatext "false" @default.
- W2402734550 isRetracted "false" @default.
- W2402734550 magId "2402734550" @default.
- W2402734550 workType "article" @default.