The proceedings of a meeting held at the Tata Institute of Fundamental Research, Bombay, in June 1992. Selected papers are included in this volume, along with invited essays on developments in algorithms for the maximum-flow problem and system specification in temporal logic.3. D. Bertsimas and J.B. Orlin: A technique for speeding up the solution of the Lagrangean dual. In proceedings of JPCO 92. 4. ... H. Edelsbrunner: Algorithms in Combinatorial Geometry. ... 11. M. Held and R.M. Karp: The traveling salesman problem and minimum spanning trees. Operations Research 18:1138-1162. 12. ... Holt, Rinehart, and Winston, 1976. 14. ... SUPERFINITENESS OF QUERY ANSWERS IN DEDUCTIVE DATABASES: AN AUTOMATA-THEORETIC APPROACH 175.
|Title||:||Foundations of Software Technology and Theoretical Computer Science|
|Publisher||:||Springer Science & Business Media - 1992-11-26|