Zuzana Beerliova

TL;DR: This work formalizes the map of the Internet problem as a combinatorial optimization problem and considers it for two different models characterized by different types of measurements, giving several upper and lower bounds on the competitive ratio and the approximation ratio in both models.

TL;DR: In this article, the problem of discovering edges and non-edges of a network, modelled as a connected undirected graph, using a minimum number of queries was studied.

TL;DR: This work studies the problem using competitive analysis and gives a randomized on-line algorithm with competitive ratio $O(\sqrt{nlogn})$ for graphs with n vertices and shows that no deterministic algorithm can have competitive ratio better than 3.

TL;DR: Lecture Notes in Computer Science (including subseries Lecture notes in Artificial Intelligence and Lecture note in Bioinformatics) as discussed by the authors, including subseries lecture notes in artificial intelligence and bioinformatism.