#### Filter Results:

- Full text PDF available (55)

#### Publication Year

1988

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Boris V. Cherkassky, Andrew V. Goldberg, Tomasz Radzik
- Math. Program.
- 1994

We conduct an extensive computational study of shortest paths algorithms , including some very recent algorithms. We also suggest new algorithms motivated by the experimental results and prove interesting theoretical results suggested by the experimental data. Our computational study is based on several natural problem classes which identify strengths and… (More)

- Tomasz Radzik, Andrew V. Goldberg
- Algorithmica
- 1991

We prove a tight @(min(nm log(nC), nmz)) bound on the number of iterations of the minimum-mean cycle canceling algorithm of Goldberg and Tarjan [13]. We do this by giving the lower bound and by improving the strongly polynomial upper bound on the number of iterations to 0(nrn2). We also give an improved version of the maximum-mean cut canceling algorithm of… (More)

- Tomasz Radzik
- Theor. Comput. Sci.
- 2002

A recommender system uses information about known associations between users and items to compute for a given user an ordered recommendation list of items which this user might be interested in acquiring. We consider ordering rules based on various parameters of random walks on the graph representing associations between users and items. We experimentally… (More)

- Bogdan S. Chlebus, Dariusz R. Kowalski, Tomasz Radzik
- Algorithmica
- 2009

Radio networks model wireless data communication when the bandwidth is limited to one wave frequency. The key restriction of such networks is mutual interference of packets arriving simultaneously at a node. The many-to-many (m2m) communication primitive involves p participant nodes from among n nodes in the network, where the distance between any pair of… (More)

We describe a new shortest paths algorithm. Our algorithm achieves the same O(nm) worst-case time bound as Bellman-Ford algorithm but is superior in practice. 1. Introduction The Bellman-Ford algorithm 1, 4, 7] is a classical algorithm for the single-source shortest paths problem. The algorithm runs in O(nm) time on a graph with n nodes and m arcs. This is… (More)

- Christoph Ambühl, Leszek Gasieniec, Andrzej Pelc, Tomasz Radzik, Xiaohui Zhang
- ACM Trans. Algorithms
- 2007

We consider the task of network exploration by a mobile agent (robot) with small memory. The agent has to traverse all nodes and edges of a network (represented as an undirected connected graph), and return to the starting node. Nodes of the network are unlabeled and edge ports are locally labeled at each node. The agent has no a priori knowledge of the… (More)

- Colin Cooper, Alan M. Frieze, Tomasz Radzik
- SIAM J. Discrete Math.
- 2009

We study properties of multiple random walks on a graph under various assumptions of interaction between the particles. To give precise results, we make the analysis for random regular graphs. The cover time of a random walk on a random r-regular graph was studied in [6], where it was shown with high probability (whp), that for r ≥ 3 the cover time is… (More)

- Colin Cooper, Ralf Klasing, Tomasz Radzik
- SIROCCO
- 2008

We consider a fixed, undirected, known network and a number of " mobile agents " which can traverse the network in synchronized steps. Some nodes in the network may be faulty and the agents are to find the faults and repair them. The agents could be software agents, if the underlying network represents a computer network, or robots, if the underlying… (More)

- Tomasz Radzik
- Encyclopedia of Optimization
- 2009