Deterministic algorithms for 2-d convex programming and 3-d online linear programming

Conference · Sun Jun 01 00:00:00 EDT 1997

OSTI ID:471703

Chan, T M ^[1]

---

1. Univ. of Miami, Coral Gables, FL (United States)

We present a deterministic algorithm for solving two-dimensional convex programs with a linear objective function. The algorithm requires O(k log k) primitive operations for k constraints; if a feasible point is given, the bound reduces to O(k log k/ log log k). As a consequence, we can decide whether k convex n-gons in the plane have a common intersection in O(k log n min (log k, log log n)) worst-case time. Furthermore, we can solve the three-dimensional online linear programming problem in o(log{sup 3} n) worst-case time per operation.

• OSTI ID: 471703
• Report Number(s): CONF-970142-; CNN: Grant DAAH04-96-1-0013; TRN: 97:001377-0052
• Resource Relation: Conference: 8. annual Association for Computing Machinery (ACM)-Society for Industrial and Applied Mathematics (SIAM) symposium on discrete algorithms, New Orleans, LA (United States), 5-7 Jan 1997; Other Information: PBD: 1997; Related Information: Is Part Of Proceedings of the eighth annual ACM-SIAM symposium on discrete algorithms; PB: 798 p.
• Country of Publication: United States
• Language: English

Related Subjects

99 MATHEMATICS
COMPUTERS
INFORMATION SCIENCE
MANAGEMENT
LAW
MISCELLANEOUS
PROGRAMMING
ALGORITHMS
THREE-DIMENSIONAL CALCULATIONS