Locating and repairing faults in a network with mobile agents (Q962168): Difference between revisions

@@ Property / cites work @@
+A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree
+Normal rank
@@ Property / cites work @@
+\((p-1)/(p+1)\)-approximate algorithms for \(p\)-traveling salesmen problems on a tree with minmax objective
+Normal rank
@@ Property / cites work @@
+Randomization helps to perform independent tasks reliably
+Normal rank
@@ Property / cites work @@
+Locating and Repairing Faults in a Network with Mobile Agents
+Normal rank
@@ Property / cites work @@
+Searching for a Black Hole in Synchronous Tree Networks
+Normal rank
@@ Property / cites work @@
+Principles of Distributed Systems
@@ Property / cites work: Principles of Distributed Systems / rank @@
+Normal rank
@@ Property / cites work @@
+Black hole search in common interconnection networks
+Normal rank
@@ Property / cites work @@
+Searching for a black hole in arbitrary networks: optimal mobile agents protocols
+Normal rank
@@ Property / cites work @@
+Mobile search for a black hole in an anonymous ring
+Normal rank
@@ Property / cites work @@
+Black Hole Search in Asynchronous Rings Using Tokens
+Normal rank
@@ Property / cites work @@
+Performing Work Efficiently in the Presence of Faults
+Normal rank
@@ Property / cites work @@
+Collective tree exploration
@@ Property / cites work: Collective tree exploration / rank @@
+Normal rank
@@ Property / cites work @@
+Hardness and approximation results for black hole search in arbitrary networks
+Normal rank
@@ Property / cites work @@
+Approximation bounds for Black Hole Search problems
+Normal rank
@@ Property / cites work @@
+A faster 2-approximation algorithm for the minmax \(p\)-traveling salesmen problem on a tree
+Normal rank