ISAAC
14 years 3 months ago
2004 Springer 
We study Pareto optimal matchings in the context of house allocation problems. We present an O( √ nm) algorithm, based on Gale’s Top Trading Cycles Method, for finding a maxim...
ISAAC
14 years 3 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...
ISAAC
14 years 3 months ago
2004 Springer
The class of interval probe graphs is introduced to deal with the physical mapping and sequencing of DNA as a generalization of interval graphs. The polynomial time recognition al...
ISAAC
14 years 3 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...
ISAAC
14 years 3 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