Sciweavers

217 search results - page 32 / 44
» Deterministic Algorithm for the t-Threshold Set Problem
Sort
View
STACS
2007
Springer
14 years 1 months ago
New Approximation Algorithms for Minimum Cycle Bases of Graphs
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Mich...
DCOSS
2007
Springer
13 years 11 months ago
Energy Efficient Intrusion Detection in Camera Sensor Networks
The problem we address in this paper is how to detect an intruder moving through a polygonal space that is equipped with a camera sensor network. We propose a probabilistic sensor ...
Primoz Skraba, Leonidas J. Guibas
CORR
2010
Springer
249views Education» more  CORR 2010»
13 years 7 months ago
Lower Bounds on Near Neighbor Search via Metric Expansion
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
Rina Panigrahy, Kunal Talwar, Udi Wieder
FOCS
2007
IEEE
14 years 2 months ago
Maximizing Non-Monotone Submodular Functions
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...
Uriel Feige, Vahab S. Mirrokni, Jan Vondrák
MFCS
2001
Springer
14 years 3 days ago
News from the Online Traveling Repairman
In the traveling repairman problem (Trp), a tour must be found through every one of a set of points (cities) in some metric space such that the weighted sum of completion times of ...
Sven Oliver Krumke, Willem de Paepe, Diana Poensge...