By Kulikov A. S.
Read or Download A 2E4-time algorithm for MAX-CUT PDF
Similar algorithms and data structures books
The papers amassed during this booklet have been released over a interval of greater than two decades in broadly scattered journals. They ended in the invention of randomness in mathematics which was once awarded within the lately released monograph on “Algorithmic details idea” by means of the writer. There the most powerful attainable model of Gödel's incompleteness theorem, utilizing an information-theoretic strategy in accordance with the dimensions of desktop courses, used to be mentioned.
Creation to information Envelopment research and Its makes use of: With DEA-Solver software program and References has been conscientiously designed by means of the authors to supply a scientific advent to DEA and its makes use of as a multifaceted instrument for comparing difficulties in quite a few contexts. The authors were concerned about DEA's improvement from the start.
- Classifying and Searching Hidden-Web Text Databases
- Database Partitioning, Table Partitioning, and Mdc for DB2 9
- Manual on the Building of Materials Databases (Astm Manual Series)
- Grammatical Inference: Algorithms and Applications: 8th International Colloquium, ICGI 2006, Tokyo, Japan, September 20-22, 2006. Proceedings
- Algorithms and Data Structures: Third Workshop, WADS '93 Montréal, Canada, August 11–13, 1993 Proceedings
Additional resources for A 2E4-time algorithm for MAX-CUT
In Proc. Fifth ACM-SIAM Symp. Discrete Algorithms (SODA), pages 573-582, 1994. AMO93 R. Ahuja, T. Magnanti, and J. Orlin. Network Flows. Prentice Hall, Englewood Cliffs NJ, 1993. AMOT88 R. Ahuja, K. Mehlhorn, J. Orlin, and R. Tarjan. Faster algorithms for the shortest path problem. Technical Report 193, MIT Operations Research Center, 1988. AMWW88 H. Alt, K. Mehlhorn, H. Wagener, and E. Welzl. Congruence, similarity and symmetries of geometric objects. Discrete Comput. , 3:237-256, 1988. And76 G.
Communications of the ACM, 18:333-340, 1975. AC91 D. Applegate and W. Cook. A computational study of the job-shop scheduling problem. ORSA Journal on Computing, 3:149-156, 1991. ACH 91 E. M. Arkin, L. P. Chew, D. P. Huttenlocher, K. Kedem, and J. S. B. Mitchell. An efficiently computable metric for comparing polygonal shapes. IEEE Trans. PAMI, 13(3):209-216, 1991. ACI92 D. Alberts, G. Cattaneo, and G. Italiano. An empirical study of dynamic graph algorithms. In Proc. Seventh ACM-SIAM Symp. Discrete Algorithms (SODA), pages 192-201, 1992.
31st IEEE Symposium on Foundations of Computer Science, pages 387-395, Pittsburgh, PA, 1992. HTM (10 of 50) [19/1/2003 1:28:01] References T. Cormen, C. Leiserson, and R. Rivest. Introduction to Algorithms. MIT Press, Cambridge MA, 1990. CM69 E. Cuthill and J. McKee. Reducing the bandwidth of sparse symmetric matrices. In Proc. 24th Nat. Conf. ACM, pages 157-172, 1969. Cof76 E. Coffman. Computer and Job shop Scheduling. Wiley, New York, 1976. Coh94 E. Cohen. Estimating the size of the transitive closure in linear time.