Sciweavers

Share
COCOON
2005
Springer
9 years 8 months ago
Exploring Simple Grid Polygons
Abstract. We investigate the online exploration problem of a shortsighted mobile robot moving in an unknown cellular room without obstacles. The robot has a very limited sensor; it...
Christian Icking, Thomas Kamphans, Rolf Klein, Elm...
COCOON
2005
Springer
9 years 8 months ago
On Sequential and 1-Deterministic P Systems
Abstract. The original definition of P-systems calls for rules to be applied in a maximally parallel fashion. However, in some cases a sequential model may be a more reasonable as...
Oscar H. Ibarra, Sara Woodworth, Hsu-Chun Yen, Zhe...
COCOON
2005
Springer
9 years 8 months ago
Interference in Cellular Networks: The Minimum Membership Set Cover Problem
Abstract. The infrastructure for mobile distributed tasks is often formed by cellular networks. One of the major issues in such networks is interference. In this paper we tackle in...
Fabian Kuhn, Pascal von Rickenbach, Roger Wattenho...
COCOON
2005
Springer
9 years 8 months ago
Bicriteria Network Design via Iterative Rounding
We study the edge-connectivity survivable network design problem with an additional linear budget constraint. We give a strongly polynomial time (3, 3)-approximation algorithm for ...
Piotr Krysta
COCOON
2005
Springer
9 years 8 months ago
Interval Subset Sum and Uniform-Price Auction Clearing
Abstract. We study the interval subset sum problem (ISSP), a generalization of the classic subset-sum problem, where given a set of intervals, the goal is to choose a set of intege...
Anshul Kothari, Subhash Suri, Yunhong Zhou
COCOON
2005
Springer
9 years 8 months ago
Distributed Weighted Vertex Cover via Maximal Matchings
Fabrizio Grandoni, Jochen Könemann, Alessandr...
COCOON
2005
Springer
9 years 8 months ago
Conditionally Critical Indecomposable Graphs
Chandan K. Dubey, Shashank K. Mehta, Jitender S. D...
COCOON
2005
Springer
9 years 8 months ago
Bounded Degree Closest k-Tree Power Is NP-Complete
Abstract. An undirected graph G = (V, E) is the k-power of an undirected tree T = (V, E ) if (u, v) ∈ E iff u and v are connected by a path of length at most k in T. The tree T ...
Michael Dom, Jiong Guo, Rolf Niedermeier
COCOON
2005
Springer
9 years 8 months ago
Radio Networks with Reliable Communication
Abstract. Problems of secure communication and computation have been studied extensively in network models, for example, Franklin and Yung have studied secure communications in the...
Yvo Desmedt, Yongge Wang, Reihaneh Safavi-Naini, H...
COCOON
2005
Springer
9 years 8 months ago
On Walrasian Price of CPU Time
Xiaotie Deng, Li-Sha Huang, Minming Li
books