752 search results - page 50 / 151 » Faster approximation algorithms for the minimum latency prob... |
146
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
A hitting set for a collection of sets is a set that has a nonempty intersection with each set in the collection; the hitting set problem is to find a hitting set of minimum card...
184
Voted
OL
2011
14 years 10 months ago
2011
Given a simple undirected graph, the minimum connected dominating set problem is to find a minimum cardinality subset of vertices D inducing a connected subgraph such that each ve...
137
click to vote
NIPS
2001
15 years 4 months ago
2001
In this paper we will show that a restricted class of constrained minimum divergence problems, named generalized inference problems, can be solved by approximating the KL divergen...
121
Voted
CCCG
2008
15 years 4 months ago
2008
We define a class of algorithms for constructing coresets of (geometric) data sets, and show that algorithms in this class can be dynamized efficiently in the insertiononly (data ...
143
click to vote
FOCS
2008
IEEE
15 years 9 months ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...