1729 search results - page 311 / 346 » On Bounds for the k-Partitioning of Graphs |
ROBOCOMM
2007
IEEE
15 years 4 months ago
2007
IEEE
— The objective of this paper is decentralized swarm aggregation with collision avoidance. Specifically, each agent is assigned with a control law which is the sum of two elemen...
ESA
2007
Springer
15 years 4 months ago
2007
Springer
Consider the following network subscription pricing problem. We are given a graph G = (V, E) with a root r, and potential customers are companies headquartered at r with locations...
ESA
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. The small world phenomenon, a.k.a. the six degree of separation between individuals, was identified by Stanley Milgram at the end of the 60s. Milgram experiment demonstr...
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
We consider approximation algorithms for non-uniform buy-at-bulk network design problems. The first nontrivial approximation algorithm for this problem is due to Charikar and Kar...
ICRA
2006
IEEE
15 years 3 months ago
2006
IEEE
– In this paper, we proposed an improved algorithm for the multi-robot complete coverage problem. Real world applications such as lawn mowing, chemical spill clean-up, and humani...