Random Geometric Problems on [0, 1]²

Authors:
Josep Díaz;Jordi Petit;Maria J. Serna
Affiliations:
-;-;-
Venue:
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Year:
1998

Citing 7
Cited 6

Probabilistic algorithm for the directed traveling salesman problem

Mathematics of Operations Research
Optimal numberings of an N N array

SIAM Journal on Algebraic and Discrete Methods
Randomized algorithms

Randomized algorithms
New approximation techniques for some ordering problems

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
The regularity lemma and approximation schemes for dense problems

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Statistical methods in algorithm design and analysis.

Statistical methods in algorithm design and analysis.
Closest-point problems

SFCS '75 Proceedings of the 16th Annual Symposium on Foundations of Computer Science

Parallel Shortest Path for Arbitrary Graphs

Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
On Range Matrices and Wireless Networks in d Dimensions

WIOPT '05 Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Experimental Study of Independent and Dominating Sets in Wireless Sensor Networks Using Graph Coloring Algorithms

WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
Thresholding random geometric graph properties motivated by ad hoc sensor networks

Journal of Computer and System Sciences
Simple and efficient greedy algorithms for hamilton cycles in random intersection graphs

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Expander properties and the cover time of random intersection graphs

MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we survey the work done for graphs on random geometric models. We present some heuristics for the problem of the Minimal linear arrangement on [0,1]2 and we conclude with a collection of open problems.