Work

Parallel multidimensional search using approximation algorithms: with applications to linear-programming and related problems

Year: 1996

Type: conference-paper

Abstract: We describe a very simple deterministic parallel algorithm for linear programming in fixed dimension d that takes poly(log log n) time in the common CRCW PRAM model and does optimal O(n) work.Our algorithm is based on multidimensional search and an effective use of approximation algorithms to speed-up the basic search in the CRCW model.Our method also yields very fast poly(log log n) algorithm for smallest enclosing sphere and approximate ham-sandwich cuts as well as an O (log n) time work-optimal algorithm for exact ham-sandwich cuts of separable point sets.For all these problems, particularly for the fixed-dimensional linear programming, o(log n) time efficient deterministic PRAM algorithms were not known until very recently.

Source: ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)

DOI: 10.1145/237502.237564

Author: Sandeep Sen

Institutions: Indian Institute of Technology Delhi, University of Newcastle Australia

Language: English

Topic: Computational Geometry and Mesh Generation

Subfield: Computer Graphics and Computer-Aided Design

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

OpenAlex ID: W2046040818

FWCI: 0.801

Cites: 27

Cited by: 7

Related to: 10