Sciweavers

1760 search results - page 11 / 352
» Connected Set Cover Problem and Its Applications
Sort
View
DCOSS
2008
Springer
13 years 9 months ago
Local PTAS for Independent Set and Vertex Cover in Location Aware Unit Disk Graphs
We present the first local approximation schemes for maximum independent set and minimum vertex cover in unit disk graphs. In the graph model we assume that each node knows its geo...
Andreas Wiese, Evangelos Kranakis
CORR
2006
Springer
160views Education» more  CORR 2006»
13 years 7 months ago
Frugality ratios and improved truthful mechanisms for vertex cover
In set-system auctions, there are several overlapping teams of agents, and a task that can be completed by any of these teams. The auctioneer's goal is to hire a team and pay...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
AAAI
2007
13 years 10 months ago
Computational Aspects of Covering in Dominance Graphs
Various problems in AI and multiagent systems can be tackled by finding the “most desirable” elements of a set given some binary relation. Examples can be found in areas as d...
Felix Brandt, Felix A. Fischer
CGF
2006
125views more  CGF 2006»
13 years 7 months ago
Translational Covering of Closed Planar Cubic B-Spline Curves
Spline curves are useful in a variety of geometric modeling and graphics applications and covering problems abound in practical settings. This work defines a class of covering dec...
Cristina Neacsu, Karen Daniels
ICUMT
2009
13 years 5 months ago
Coverage and adaptive scheduling algorithms for criticality management on video wireless sensor networks
In WSN-based surveillance systems power conservation is an important issue but one must also ensure that the application's objectives are met. In this paper, we jointly addres...
Abdallah Makhoul, Rachid Saadi, CongDuc Pham