2 citations · 2 across the 3 of their papers we have counts for
Showing 2015Show all
3 papers · 1 filter
cs.DS2015
Online Algorithms for Multi-Level Aggregation
Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka +7
In the Multi-Level Aggregation Problem (MLAP), requests arrive at the nodes of an edge-weighted tree T, and have to be served eventually. A service is defined as a subtree X of T t…
cs.DM2015★ 2 cited
IV-matching is strongly NP-hard
Lukáš Folwarczný, Dušan Knop
IV-matching is a generalization of perfect bipartite matching. The complexity of finding IV-matching in a graph was posted as an open problem at the ICALP 2014 conference. In this…
cs.CC2015
General Caching Is Hard: Even with Small Pages
Lukáš Folwarczný, Jiří Sgall
Caching (also known as paging) is a classical problem concerning page replacement policies in two-level memory systems. General caching is the variant with pages of different sizes…