Randomized Algorithms

Two Interesting Limit Problems

by Cody Johnson

Randomizirani algoritmi za NP-teške probleme

by Konrad Burnik

Search Result Clustering via Randomized Partitioning of Query-Induced Subgraphs

by Aleksandar Bradic

Approximation Algorithms for Finding Best Viewpoints

by Richard Webber

by Michael E. Houle and Richard Webber.
appears in Proc. 6th Int. Symp. Graph Drawing (GD), 13-15 Aug 1998, Montreal, Canada;
Lecture Notes in Computer Science (LNCS), no. 1547, pp. 210-223, Springer, 1998.

We address the problem of finding viewpoints that preserve the relational structure of a three-dimensional graph... more We address the problem of finding viewpoints that preserve the relational structure of a three-dimensional graph drawing under orthographic parallel projection. Previously, algorithms for finding the best viewpoints under two natural models of viewpoint "goodness" were proposed. Unfortunately, the inherent combinatorial complexity of the problem makes finding exact solutions is impractical. In this paper, we propose two approximation algorithms for the problem, commenting on their design, and presenting results on their performance.

Using Randomization to Cope With Circuit Uncertainty

by Gholamhossein Tavasoli

A Comparative Study of Genetic Algorithm Components In Simulation-Based Optimisation

by Birkan Can