Demo Data from EDBT 2026 / reviewers in the wild / expert
Ezzedine Abassi
dblp:48/3570
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 1991
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer networks
1 paper |
Network optimization and economics · 91% Internet architecture and protocols · 9% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Network optimization and economics › network flow
multicommodity flow |
0.0 | 1 | 1991 | Decomposition Methods for Multihour Synthesis of Private Telecommunication Networks · INFOCOM 1991 |
Network optimization and economics › network design
network synthesis |
0.0 | 1 | 1991 | Decomposition Methods for Multihour Synthesis of Private Telecommunication Networks · INFOCOM 1991 |
Network optimization and economics
resource allocation |
0.0 | 1 | 1991 | Decomposition Methods for Multihour Synthesis of Private Telecommunication Networks · INFOCOM 1991 |
Methods — techniques the papers use, named apart from their topics
resource decomposition · 0.0lagrangian relaxation · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1991 | Decomposition Methods for Multihour Synthesis of Private Telecommunication NetworksabstractThe optimal synthesis of private telecommunication networks subject to multiple nonsimultaneous demands is considered. A model is given for the multiservice network synthesis model with an accurate representation of the conversion and access costs, while maintaining a classical multicommodity flow representation of the network. This is done by increasing the original network to produce an augmented network. Two decomposition methods for solving the network synthesis problem are presented. The first one is a classical Lagrangian relaxation method and the second is a resource-decomposition-type technique. Some preliminary computational results in both cases are presented. These show that the two methods converge within reasonable computation times. The results also demonstrate that the multihour aspect of the synthesis of multiservice networks should be taken into account in order to realize fully the economies that are possible due to the noncoincidence of different types of demands.> André Girard, Ezzedine Abassi |
INFOCOM | 2 |