20 Result(s)
within
Chapter
Rastislav Královič
Algorithm Analysis and Problem Complexity
-
Chapter and Conference Paper
Improved Lower Bounds for Shoreline Search
Shoreline search is a natural and well-studied generalisation of the classical cow-path problem: k initially co-located unit speed agents are searching for a line (called shoreline) in 2 dimensional Euclidean spa...
-
Chapter and Conference Paper
Exploration of Time-Varying Connected Graphs with Silent Agents
Exploration is a fundamental task in mobile computing. We study the version where a group of cooperating agents is situated in a graph, and the task is to make sure that every vertex of the graph is visited by...
-
Chapter and Conference Paper
The Complexity of Paging Against a Probabilistic Adversary
We consider deterministic online algorithms for paging. The offline version of the paging problem, in which the whole input is given in advance, is known to be easily solvable. If the input is random, chosen a...
-
Chapter and Conference Paper
Edge-Editing to a Dense and a Sparse Graph Class
We consider a graph edge-editing problem, where the goal is to transform a given graph G into a disjoint union of two graphs from a pair of given graph classes, investigating what properties of the classes make t...
-
Chapter and Conference Paper
Disjoint Path Allocation with Sublinear Advice
We study the disjoint path allocation problem. In this setting, a path \(P\) ...
-
Chapter and Conference Paper
Treasure Hunt with Advice
The node searching problem (a.k.a. treasure hunt) is a fundamental task performed by mobile agents in a network and can be viewed as an online version of the shortest path problem: an agent starts in a vertex ...
-
Chapter and Conference Paper
Advice Complexity: Quantitative Approach to A-Priori Information
We survey recent results from different areas, studying how introducing per-instance a-priori information affects the solvability and complexity of given tasks. We mainly focus on distributed, and online compu...
-
Chapter and Conference Paper
Independent Set with Advice: The Impact of Graph Knowledge
We are interested in online graph problems where the knowledge of the underlying graph G (all arriving vertices are from G) has a profound impact on the size of the advice needed to solve the problem efficiently....
-
Chapter and Conference Paper
Online Graph Exploration with Advice
We study the problem of exploring an unknown undirected graph with non-negative edge weights. Starting at a distinguished initial vertex s, an agent must visit every vertex of the graph and return to s. Upon visi...
-
Chapter and Conference Paper
Routing in Carrier-Based Mobile Networks
The past years have seen an intense research effort directed at study of delay/disruption tolerant networks and related concepts (intermittently connected networks, opportunistic mobility networks). As a funda...
-
Chapter and Conference Paper
On the Advice Complexity of the k-Server Problem
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been introduced as an alternative measu...
-
Chapter and Conference Paper
Black Hole Search in Directed Graphs
We consider the problem of cooperative network exploration by agents under the assumption that there is a harmful host present in the network that destroys the incoming agents without outside trace – the so-ca...
-
Chapter and Conference Paper
Periodic Data Retrieval Problem in Rings Containing a Malicious Host
In the problems of exploration of faulty graphs, a team of cooperating agents is considered moving in a network containing one or more nodes that can harm the agents. A most notable among these problems is the pr...
-
Chapter and Conference Paper
Information Complexity of Online Problems
What is information? Frequently spoken about in many contexts, yet nobody has ever been able to define it with mathematical rigor. The best we are left with so far is the concept of entropy by Shannon, and the...
-
Chapter and Conference Paper
On the Advice Complexity of Online Problems
In this paper, we investigate to what extent the solution quality of online algorithms can be improved by allowing the algorithm to extract a given amount of information about the input. We consider the recent...
-
Chapter and Conference Paper
Deterministic Models of Communication Faults
In this paper we survey some results concerning the impact of faulty environments on the solvability and complexity of communication tasks. In particular, we focus on deterministic models of faults in synchron...
-
Chapter and Conference Paper
Online Bandwidth Allocation
The paper investigates a version of the resource allocation problem arising in the wireless networking, namely in the OVSF code reallocation process. In this setting a complete binary tree of a given height n is ...
-
Chapter and Conference Paper
Rapid Almost-Complete Broadcasting in Faulty Networks
This paper studies the problem of broadcasting in synchronous point-to-point networks, where one initiator owns a piece of information that has to be transmitted to all other vertices as fast as possible. The ...
-
Chapter and Conference Paper
On Fractional Dynamic Faults with Threshold
Unlike localized communication failures that occur on a fixed (although a priori unknown) set of links, dynamic faults can occur on any link. Known also as mobile or ubiquitous faults, their presence makes many t...
-
Chapter and Conference Paper
On Semi-perfect 1-Factorizations
The perfect 1-factorization conjecture by A. Kotzig [7] asserts the existence of a 1-factorization of a complete graph K 2n in which any two 1-factors induce a Hamiltonian cycle. This conject...
