157
click to vote
ISAAC
15 years 8 months ago
2004 Springer 
It has been suggested that a major obstacle in finding an index calculus attack on the elliptic curve discrete logarithm problem lies in the difficulty of lifting points from elli...
148
click to vote
ISAAC
15 years 8 months ago
2004 Springer 
For c ∈ R, a c-spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most c times their geometric...
137
click to vote
ISAAC
15 years 8 months ago
2004 Springer
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
137
click to vote
ISAAC
15 years 8 months ago
2004 Springer
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
136
click to vote
ISAAC
15 years 8 months ago
2004 Springer
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...
|
Algorithms