Approximating capacitated tree-routings in networks
Year of publication: |
2011
|
---|---|
Authors: | Morsy, Ehab ; Nagamochi, Hiroshi |
Published in: |
Journal of combinatorial optimization. - Norwell, Mass. : Springer Science + Business Media, ISSN 1382-6905, ZDB-ID 1339574-9. - Vol. 21.2011, 2, p. 254-267
|
Subject: | Unternehmensnetzwerk | Business network | Netzwerk | Network | Soziales Netzwerk | Social network | Heuristik | Heuristics | Kapazitätsplanung | Capacity planning | Graphentheorie | Graph theory | Produktionssteuerung | Production control |
-
The vertex attack tolerance of complex networks
Matta, John, (2017)
-
Effects of Covid-19 on the BIST 100 network structure
Şükrüoğlu, Deniz, (2022)
-
Topology-aware approach for reducing power consumption in backbone networks
Hussein, Mohammed, (2019)
- More ...
-
Approximation algorithms for inventory constrained scheduling on a single machine
Morsy, Ehab, (2015)
-
Graph Algorithms for Network Connectivity Problems
Nagamochi, Hiroshi, (2004)
-
Vehicle Scheduling on a Tree to Minimize Maximum Lateness
Karuno, Yoshiyuki, (1996)
- More ...