414 search results - page 49 / 83 » On discrete norms of polynomials |
112
Voted
FOCS
2004
IEEE
15 years 4 months ago
2004
IEEE
Let p > 1 be any fixed real. We show that assuming NP RP, there is no polynomial time algorithm that approximates the Shortest Vector Problem (SVP) in p norm within a constant ...
SIROCCO
2004
15 years 1 months ago
2004
In this paper we study the range assignment problem in static ad-hoc networks on metric spaces. We consider the h-strong connectivity and h-broadcast problems on trees, high dimens...
103
click to vote
SODA
2000
ACM
15 years 1 months ago
2000
ACM
In this paper we give approximation algorithms for several proximity problems in high dimensional spaces. In particular, we give the rst Las Vegas data structure for (1 + )-neares...
86
Voted
ADCM
2004
15 years 12 days ago
2004
This paper considers extremal systems of points on the unit sphere Sr Rr+1, related problems of numerical integration and geometrical properties of extremal systems. Extremal sys...
90
Voted
JCO
2010
14 years 11 months ago
2010
Given a directed graph G = (N, A) with arc capacities uij and a minimum cost flow problem defined on G, the capacity inverse minimum cost flow problem is to find a new capacit...