Matches in SemOpenAlex for { <https://semopenalex.org/work/W3032040206> ?p ?o ?g. }
Showing items 1 to 62 of
62
with 100 items per page.
- W3032040206 endingPage "236" @default.
- W3032040206 startingPage "224" @default.
- W3032040206 abstract "Motivated by a warehouse logistics problem we study mappings of the vertices of a graph onto prescribed points on the real line that minimize the sum (or equivalently, the average) of the coordinates of the right ends of all edges. We focus on graphs whose edge numbers do not exceed the vertex numbers too much, that is, graphs with few cycles. Intuitively, dense subgraphs should be placed early in the ordering, in order to finish many edges soon. However, our main “calculation trick” is to compare the objective function with the case when (almost) every vertex is the right end of exactly one edge. The deviations from this case are described by “charges” that can form “dipoles”. This reformulation enables us to derive polynomial algorithms and NP-completeness results for relevant special cases, and FPT results." @default.
- W3032040206 created "2020-06-05" @default.
- W3032040206 creator A5056718928 @default.
- W3032040206 date "2020-01-01" @default.
- W3032040206 modified "2023-09-27" @default.
- W3032040206 title "Ordering a Sparse Graph to Minimize the Sum of Right Ends of Edges" @default.
- W3032040206 cites W13423557 @default.
- W3032040206 cites W1502167149 @default.
- W3032040206 cites W1965193466 @default.
- W3032040206 cites W1988217358 @default.
- W3032040206 cites W1995472412 @default.
- W3032040206 cites W2007525305 @default.
- W3032040206 cites W2078638564 @default.
- W3032040206 cites W2346271234 @default.
- W3032040206 cites W2893083669 @default.
- W3032040206 cites W2953275252 @default.
- W3032040206 cites W960413108 @default.
- W3032040206 doi "https://doi.org/10.1007/978-3-030-48966-3_17" @default.
- W3032040206 hasPublicationYear "2020" @default.
- W3032040206 type Work @default.
- W3032040206 sameAs 3032040206 @default.
- W3032040206 citedByCount "1" @default.
- W3032040206 countsByYear W30320402062021 @default.
- W3032040206 crossrefType "book-chapter" @default.
- W3032040206 hasAuthorship W3032040206A5056718928 @default.
- W3032040206 hasBestOaLocation W30320402061 @default.
- W3032040206 hasConcept C114614502 @default.
- W3032040206 hasConcept C118615104 @default.
- W3032040206 hasConcept C132525143 @default.
- W3032040206 hasConcept C154945302 @default.
- W3032040206 hasConcept C162307627 @default.
- W3032040206 hasConcept C33923547 @default.
- W3032040206 hasConcept C41008148 @default.
- W3032040206 hasConcept C80899671 @default.
- W3032040206 hasConceptScore W3032040206C114614502 @default.
- W3032040206 hasConceptScore W3032040206C118615104 @default.
- W3032040206 hasConceptScore W3032040206C132525143 @default.
- W3032040206 hasConceptScore W3032040206C154945302 @default.
- W3032040206 hasConceptScore W3032040206C162307627 @default.
- W3032040206 hasConceptScore W3032040206C33923547 @default.
- W3032040206 hasConceptScore W3032040206C41008148 @default.
- W3032040206 hasConceptScore W3032040206C80899671 @default.
- W3032040206 hasLocation W30320402061 @default.
- W3032040206 hasLocation W30320402062 @default.
- W3032040206 hasOpenAccess W3032040206 @default.
- W3032040206 hasPrimaryLocation W30320402061 @default.
- W3032040206 hasRelatedWork W1719252778 @default.
- W3032040206 hasRelatedWork W2008276241 @default.
- W3032040206 hasRelatedWork W2031098440 @default.
- W3032040206 hasRelatedWork W2034217845 @default.
- W3032040206 hasRelatedWork W2169820283 @default.
- W3032040206 hasRelatedWork W2374778222 @default.
- W3032040206 hasRelatedWork W2555545330 @default.
- W3032040206 hasRelatedWork W2964041938 @default.
- W3032040206 hasRelatedWork W4307385446 @default.
- W3032040206 hasRelatedWork W922283457 @default.
- W3032040206 isParatext "false" @default.
- W3032040206 isRetracted "false" @default.
- W3032040206 magId "3032040206" @default.
- W3032040206 workType "book-chapter" @default.