You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: README.md
+12-15Lines changed: 12 additions & 15 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -5,6 +5,8 @@ This is repository implements and benchmarks state-of-the-art and new approaches
5
5
6
6
The repository contains two types of algorithms -- exact algorithms and heuristics. The best heuristic algorithm considered in this paper in terms of quality, based on a simple breadth-first search, computes the optimum result on more than 90% of the instances and is on average only 2.4% worse than the optimum solution. Our exact algorithm maintains an optimal edge orientation during both insertions and deletions. The update time of our algorithm is up to 6 orders of magnitude faster than static exact algorithms. This repository is joint work of Jannick Borowitz, Ernestine Großmann, Henrik Reinstädtler, Christian Schulz and Fabian Walliser.
7
7
8
+
For optimal static algorithms for the problem, have a look at <ahref="https://github.com/HeiOrient/HeiOrient">HeiOrient</a>.
9
+
8
10
Performance of Heuristic Algorithms
9
11
=====
10
12
@@ -118,21 +120,16 @@ If you used the exact algorithms:
118
120
```
119
121
120
122
When using the heuristic solvers, please cite:
123
+
121
124
```
122
-
@article{DBLP:journals/corr/abs-2301-06968,
123
-
author = {Jannick Borowitz and
124
-
Ernestine Gro{\ss}mann and
125
-
Christian Schulz},
126
-
title = {Engineering Fully Dynamic {\(\Delta\)}-Orientation Algorithms},
0 commit comments