Loading...
Ordering a Sparse Graph to Minimize the Sum of Right Ends of Edges
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 numbe...
Na minha lista:
| Udgivet i: | Combinatorial Algorithms |
|---|---|
| Hovedforfatter: | |
| Format: | Artigo |
| Sprog: | Inglês |
| Udgivet: |
2020
|
| Fag: | |
| Online adgang: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7254886/ https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/978-3-030-48966-3_17 |
| Tags: |
Tilføj Tag
Ingen Tags, Vær først til at tagge denne postø!
|