1 citations · 1 across the 1 of their papers we have counts for
4 papers
Priority Algorithms with Advice for Disjoint Path Allocation Problems
Hans-Joachim Böckenhauer, Fabian Frei, Silvan Horvath
We analyze the Disjoint Path Allocation problem (DPA) in the priority framework. Motivated by the problem of traffic regulation in communication networks, DPA consists of allocatin…
Complexity of Stability
Fabian Frei, Edith Hemaspaandra, Jörg Rothe
Graph parameters such as the clique number, the chromatic number, and the independence number are central in many areas, ranging from computer networks to linguistics to computatio…
Efficient Circuit Simulation in MapReduce
Fabian Frei, Koichi Wada
The MapReduce framework has firmly established itself as one of the most widely used parallel computing platforms for processing big data on tera- and peta-byte scale. Approaching…
Finding Optimal Solutions With Neighborly Help
Elisabet Burjons, Fabian Frei, Edith Hemaspaandra +2
Can we efficiently compute optimal solutions to instances of a hard problem from optimal solutions to neighboring (i.e., locally modified) instances? For example, can we efficientl…