Minimax parametric optimization problems and multi-dimensional parametric searching

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2001, Pages 75-83

  Tokuyama, T ^a  

^a TOHOKU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

OPTIMIZATION; PARALLEL ALGORITHMS; PROBLEM SOLVING; SENSITIVITY ANALYSIS; THEOREM PROVING;

PARAMETRIC SEARCHING;

COMPUTATIONAL GEOMETRY;

EID: 0034832750     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/380752.380777     Document Type: Conference Paper

References (24)

1. Matroid optimization and algorithms
2. Cutting hyperplanes for divide-and-conquer
3. Slowing down sorting network to obtain faster sorting algorithms
4. Strongly polynomial-time and NC algorithms for detecting cycles in dynamic graphs
5. Linear programming in low dimensions
6. Geometric lower bounds for parametric matroid optimization problems
7. A subexponential algorithm for abstract optimization problems
8. Minimax geometric fitting of two corresponding set of points
9. Minimum cuts in near-linear time
10. Parametric polymatroid optimization and its geometric applications
11. Computing the optimal bridge between two polygons
12. Efficient partition trees
13. Linear optimization queries
14. Applying parallel computation algorithms in the design of serial algorithms
15. Linear programming in linear time when dimension is small
16. Is there an algebraic proof for P ≠ NC?
17. Using separation algorithms in fixed dimension
18. Parametric search
19. A combinatorial bound for linear programming and related problems
20. On optimal bridges between two convex regions
21. Efficient algorithms for the minimum diameter bridge problem