1671 search results - page 65 / 335 » On the Covering Steiner Problem |
89
Voted
TCC
2007
Springer
15 years 6 months ago
2007
Springer
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...
CORR
2010
Springer
15 years 24 days ago
2010
Springer
Given a directed graph G with non negative cost on the arcs, a directed tree cover of G is a directed tree such that either head or tail (or both of them) of every arc in G is touc...
104
Voted
CCCG
2007
15 years 2 months ago
2007
Given a set P of n points in R2 , we consider two related problems. Firstly, we study the problem of computing two isothetic unit squares which may be either disjoint or intersect...
117
click to vote
SODA
2010
ACM
15 years 10 months ago
2010
ACM
We consider robust network design problems where the set of feasible demands may be given by an arbitrary polytope or convex body more generally. This model, introduced by BenAmeu...
104
click to vote
APPROX
2006
Springer
15 years 4 months ago
2006
Springer
In the minimum entropy set cover problem, one is given a collection of k sets which collectively cover an n-element ground set. A feasible solution of the problem is a partition o...