An additive spanner of an unweighted undirected graph G with distortion d is a subgraph H such that for any two vertices u, v ∈ G, we have δH(u, v) ≤ δG(u, v) + d. For every...
In the NP-hard Cluster Editing problem, we have as input an undirected graph G and an integer k 0. The question is whether we can transform G, by inserting and deleting at most k ...
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
Today's hardware graphics accelerators incorporate techniques to antialias edges and minimize geometry-related sampling artifacts. Two such techniques, brute force supersampl...