Algebrization and randomization methods

Handbook of Combinatorial Optimization

Volumn 1-5, Issue , 2013, Pages 171-220

  Ding, Liang ^a   Fu, Bin ^a  

^a UNIVERSITY OF TEXAS PAN AMERICAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; RANDOM PROCESSES;

CRITICAL PROBLEMS; DESIGN OF ALGORITHMS; HAMILTONIAN PATH PROBLEMS; RANDOMIZATION TECHNIQUES;

PROBLEM SOLVING;

EID: 84920547166     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/978-1-4419-7997-1_80     Document Type: Chapter

References (77)

1. S. Acharya, R. Alonso, M. Franklin, S. Zdonik, Broadcast disks: data management for asymmetric communication environments, in The 1995 ACM SIGMOD/PODS Conference, San Jose, CA, 1995, pp. 199-210.
2. N. Alon, R. Yuster, U. Zwick, Color-coding. J. ACM 42, 844-856 (1995)
3. D.L. Applegate, R.E. Bixby, V. Chvatal, W.J. Cook, The Traveling Salesman Problem: A Computational Study (Princeton University Press, Princeton, 2007)
4. S. Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy, Proof verification and the hardness of approximation problems. J. ACM 45(3), 501555 (1998)
5. E.T. Bax, Inclusion and exclusion algorithm for the Hamiltonian Path Problem. Inf. Process. Lett. 47(4), 203-207 (1993)
6. R. Beigel, The polynomial method in circuit compplexity, in Proceedings of the Eighth Conference on Structure in Complexity Theory, San Diego, CA, 1993, pp. 82-95.
7. R. Bellman, Combinatorial processes and dynamic programming, in Proceedings of Symposia in Applied Mathematics 10, American Mathematical Society, Columbia University, 24-26 Apr 1960, pp. 217-249. Providence (R.I.)
8. R. Bellman, Dynamic programming treatment of the travelling salesman problem. J. ACM 9(1), 61-63 (1962)
9. A. Björklund, Determinant sums for undirected hamiltonicity, in Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, FOCS, Las Vegas, NV, 2010.
10. A. Björklund, Exact covers via determinants, in Symposium on Theoretical Aspects of Computer Science 2010, Nancy, France, 2010, pp. 95-106.
11. A. Björklund, P. Kaski, T. Husfeldt, Fourier meets MObius: fast subset convolution, in Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, CA, 2007.
12. A. Björklund, T. Husfeldt, P. Kaski, M. Koivisto, The travelling salesman problem in bounded degree graphs, in Proceedings of the 35th International Colloquium on Automata, Languages and Programming, ICALP, Reykjavik, Iceland, 2008.
13. H. Broersma, F.V. Fomin, P. Hof, D. Paulusma, Fast exact algorithms for Hamiltonicity in claw-free graphs, in Graph-Theoretic Concepts in Computer Science, Montpellier, France, vol. 5911/2010, 2010, pp. 44-53.
14. J.R. Bunch, J.E. Hopcroft, Triangular factorization and invertion by fast matrix multiplication. Math. Comput. 28, 231-236 (1974)
15. Z. Chen, B. Fu, The complexity of testing monomials in multivariate polynomials, in Proceedings of the 5th International Conference on Combinatorial Optimization and Applications, Zhangjiajie, China, 4-6 Aug 2011. Lecture notes in computer science, vol. 6831, pp. 1-15.
16. Z. Chen, B. Fu, Approximating multilinear monomial coefficients and maximum multilinear monomials in multivariate polynomials. J. Comb. Optim. 25(2), 234-254 (2013)
17. Z. Chen, M. Kao, Reducing randomness via irrational numbers. SIAM J. Comput. 29(4), 1247-1256 (2000)
18. X. Chen, J. Zheng, Z. Fu, P. Nan, Y. Zhong, S. Lonardi, T. Jiang, Computing the assignment of orthologous genes via genome rearrangement, in Proceedings of the 3rd Asia-Pacific Bioinformatics Conference (APBC'05), Singapore, 2005, pp. 363-378.
19. J. Chen, S. Lu, S. Sze, F. Zhang, Improved algorithms for path, matching, and packing problems, in Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA), New Orleans, LA, 2007, pp. 298-307.
20. Z. Chen, B. Fu, Y. Liu, R. Schweller, Algorithms fortesting monomials in multivariate polynomials, in Proceedings of the 5th International Conference on Combinatorial Optimization and Applications, Zhangjiajie, China. Lecture Notes in Computer Science, vol. 6831, pp. 16-30 (2011)
21. M. Chrobak, R Kolman, J. Sgall, The greedy algorithm for the minimum common string partition problem, in Proceedings of the 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX'04), Cambridge, MA. Lecture Notes in Computer Science, vol. 3122, 2004, pp. 84-95.
22. D. Coppersmith, S. Winograd, Matrix multiplication via arithmetic progressions, J. Symb. Comput. 9, 251-280 (1990)
23. T.H. Cormen, C.E. Leiserson, R.L. Rivest, C. Stein, Introduction to Algorithms, 3rd edn. (MIT, Cambridge, 2009)
24. P. Damaschke, Minimum common string partition parameterized, in Proceedings of the 8th Workshop on Algorithms in Bioinformatics (WABI'08), Karlsruhe, Germany. Lecture Notes in Computer Science, vol. 5251, 2008, pp. 87-98.
25. W.E. Deskins, Abstract Algebra, Rep Una edn. (Dover Publications, New York, 1996)
26. Liang Ding, Intractability of Integration and Derivative for Multivariate Polynomial and Trigonometric Function. Master thesis, Advisor Bin Fu, University of Texas-Pan American, Aug 2012.
27. B. Fu, C. Huang, Z. Lu, W. Wu, K. Yang, W. Lee, Minimizing the access time of multi-item requests in wireless data broadcast environments. (Submitted for Conference Publication)
28. D. Eppstein, The traveling salesman problem for cubic graphs. J. Graph Algorithms Appl. 11(1), 61-81 (2007)
29. U. Feige, S. Goldwasser, L. Lovasz, S. Safra, M. Szegedy, Interactive proofs and the hardness of approximating cliques. J. ACM 43(2), 268-292 (1996)
30. K. Foltz, L. Xu, J. Bruck, Scheduling for efficient data broadcast over two channels, in Proceedings of 2004 IEEE International Symposium on Information Theory, Chicago, IL, 2004, pp. 113-116.
31. B. Fu, Separating PH from PP by relativization. Acta Math. Sin. 8(3), 329-336 (1992)
32. B. Fu, Multivariate polynomial integration and derivative are polynomial time inapprox- imable unless P = NP, in Proceedings of the Joint International Conference on Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, Beijing, China, 2012, pp. 182-191.
33. B. Fu, H. Jiang, B. Yang, B. Zhu, Exponential and polynomial time algorithms for the minimum common string partition problem. In Proceedings of the 5th International Conference on Combinatorial Optimization and Applications, COCOA 2011, Zhangjiajie, China. Lecture notes in computer science, vol. 6831, 2011, pp. 299-310.
34. X. Gao, Z. Lu, W. Wu, B. Fu, Algebraic algorithm for scheduling data retrieval in multichannel wireless data broadcast environments, in Proceedings of Combinatorial Optimization and Applications - 5th International Conference, COCOA 2011, Zhangjiajie, China, 4-6 Aug 2011.
35. H. Gebauer, On the number of Hamilton cycles in bounded degree graphs, in Proceedings of the Fourth Workshop on Ananlytic Algorithms and Combinatories, ANALCO, 2008 (SIAM, Philadelphia, 2008)
36. I. Goldstein, M. Lewenstein, Quick greedy computation for minimum common string partitions, in Proceedings of the 22nd Annual Symposium on Combinatorial Pattern Matching (CPM'11), Palermo, Italy, 2011. To appear
37. A. Goldstein, P. Kolman, J. Zheng, Minimum common string partitioning problem: hardness and approximations, in Proceedings of the 15th International Symposium on Algorithms and Computation (ISAAC'04), Hong Kong, China. Lecture Notes in Computer Science, vol. 3341, 2004, pp. 473-484. Also in: The Electronic Journal of Combinatorics 12 (2005), paper R50.
38. M. Held, R.M. Karp, A dynamic programming approach to sequencing problems. J. Soc. Ind. Appl. Math. 10(1), 196-210 (1962)
39. J.L. Huang, M.S. Chen, Broadcast program generation for unordered queires with data replication, in Proceedings of the 8th ACM Symposium on Applied Computing, Melbourne, FL, 2003, pp. 866-870.
40. J.L. Huang, M.S. Chen, Dependent data broadcasting for unordered queries in a multiple channel mobile environment. IEEE Trans. Knowl. Data Eng. 16, 1143-1156 (2004)
41. J.L. Huang, M.S. Chen, W.C. Peng, Broadcasting dependent data for ordered queries with data replication in a multi-channel mobile environment, in Proceedings of the 19th IEEE International Conference on Data Engineering, Bangalore, India, 2003, pp. 692-694.
42. A.R. Hurson, A.M. Munoz-Avila, N. Orchowski, B. Shirazi, Y. Jiao, Power aware data retrieval protocols for indexed broadcast parallel channels. Previous Mobile Comput. 2(1), 85-107 (2006)
43. K. Iwama, T. Nakashima, An improved exact algorithm for cubic graph TSP. Computing and Combinatorics. Lecture Notes in Computer Science, vol. 4598 (Springer, New York/Berlin/Heidelberg 2007), pp. 108-117.
44. N. Jacobson, Basic Algebra I, 2nd edn. (Dover Publications, Mineola, 2009)
45. M. Jerrum, A. Sinclaire, E. Vigoda, A polynomial-time ap- priximation algorithm for the permanent of a matrix with nonnegative entries. J. ACM 51(4), 671-697 (2004)
46. T. Jiang, W. Xiang, H.H. Chen, Q. Ni, Multicast broadcast services support in OFDMA-based WiMAX systems. IEEE Commun. Mag. 45(8), 78-86 (2007)
47. H. Jiang, B. Zhu, D. Zhum H. Zhu, Minimum common string partition revisited. J. Comb. Optim. 23, 519-527 (2010). doi:10.1007/s10878-010-9370-2.
48. J. Juran, A.R. Hurson, N. VijayKrishnan, S. Kim, Data organization and retrieval on parallel air channels: performance and energy issues. Wirel. Netw. 10(2), 183-195 (2004)
49. V. Kabanets, R. Impagliazzo, Derandomizing polynomial identity tests means proving circuit lower bounds. Comput. Complex. 13(1-2), 1-46 (2004)
50. H. Kaplan, N. Shafrir, The greedy algorithm for edit distance with moves. Inf. Process. Lett. 97(1), 23-27 (2006)
51. R.M. Karp, Reducibility among combinatorial problems, in Complexity of Computer Computations (Plenum, New York, 1972), pp. 85-103.
52. R.M. Karp, Dynamic programming meets the principle of inclusion and exclusion. Oper. Res. Lett. 1(2), 49-51 (1982)
53. B.P. Kelley, R. Sharan, R.M. Karp, T. Sittler, D.E. Root, B.R. Stockwell, T. Ideker, Conserved pathways within bacteria and yeast as revealed by global protein network alignment. Proc. Natl. Acad. Sci. USA 100, 11394-11399 (2003)
54. R. Kennes, Computational aspects of the Möbius transform of a graph. IEEE Trans. Syst. Man Cybern. 22, 201-223 (1991)
55. nl/3). J. Comput. Syst. Sci. - STOC 2001. 68(2), 303-318 (2004)
56. J. Kneis, D. Molle, S. Richter, P. Rossmanith, Divide-and-color, in Proceedings of the International Workshop on Graph-Theoretic Concepts in Computer Science (WG), Bergen, Norway. Lecture Notes in Computer Science, vol. 4271 (Springer, 2006), pp. 58-67.
57. S. Kohn, A. Gottlieb, M. Kohn, A generating function approach to the traveling salesman problem, in ACM Annual Conference, Seattle, WA (ACM, 1977), pp. 294-300.
58. P. Kolman, Approximating reversal distance for strings with bounded number of duplicates, in Proceedings of the 30th International Symposium on Mathematical Foundations of Computer Science (MFCS'05), Gdansk, Poland. Lecture Notes in Computer Science, vol. 3618, 2005, pp. 580-590.
59. P. Kolman, T. Walen, Reversal distance for strings with duplicates: linear time approximation using hitting set, in Proceedings 4th Workshop on Approximation and Online Algorithms (WAOA'06), Zurich, Switzerland. Lecture Notes in Computer Science, vol. 4368, 2006, pp. 279-289.
60. P. Kolman, T. Walen, Approximating reversal distance for strings with bounded number of duplicates. Discret. Appl. Math. 155(3), 327-336 (2007)
61. I. Koutis, Faster algebraic algorithms for path and packing problems, in Automata, Languages and Programming. Lecture Notes in Computer Science, vol. 5125/2008 (Springer, Berlin/Heidelberg, 2008), pp. 575-586.
62. G. Lee, M.S. Yeh, S.C. Lo, A. Chen, A strategy for efScient access of multiple data items in mobile environment, in Proceedings of the 3rd International Conference on Mobile Data Management, Singapore, 2002, pp. 71-78.
63. A. Manindra, K. Neeraj, S. Nitin, PRIMES is in P. Ann. Math. 160(2), 781-793 (2004)
64. M. Minsky, S. Papert, Perceptrons (expanded edition 1988) (MIT Press, Cambridge, MA, 1968)
65. R. Motwani, P. Raghavan, Randomized Algorithms (Cambridge Ubiversity Press, Cambridge/New York, 1995)
66. C. Papadimitriou, M. Yannakakis, On limited nondeterminism and the complexity of the V-C dimension. J. Comput. Syst. Sci. 53, 161-170 (1996)
67. J.T. Schwartz, Fast probabilistic algorithms for verification of polynomial identities. J. ACM 27(4), 701-717 (1980)
68. J. Scott, T. Ideker, R.M. Karp, R. Sharan, Efficient algorithms for detecting signaling pathways in protein interaction networks. J. Comput. Biol. 13, 133-144 (2006)
69. A. Shamir, IP = PSPACE. J. ACM 39(4), 869-877 (1992)
70. D. Shapira, J. Storer, Edit distance with move operations, in Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching (CPM'02)(SODA'02), Fukuoka, Japan, 2002, pp. 667-676.
71. Y. Shi, X. Gao, J. Zhong, W. Wu, Efficient parallel data retrieval protocols with MIMO antenae for data broadcast in 4G wireless communications, in Proceedings of the 21st International Conference on Database and Expert Systems Applications, DEXA (2), Bilbao, Spain, 2010, pp. 80-95.
72. C.A. Tovey, A simplified satisfiability problem. Discret. Appl. Math. 8, 85-89 (1984)
73. L. Valiant, Completeness classes in algebra, in Proceedings of the eleventh Annual ACM Symposium on Theory of Computing, Atlanta, USA, 1979, pp. 249-261.
74. k) time. Inf. Process. Lett. 109(6), 315-318 (2009)
75. G.J. Woeginger, Exact algorithms for NP-hard problems: a survey, in Combinatorial Optimization C Eureka, You Shrink! Lecture Notes in Computer Science, vol. 2570 (Springer, Berlin, 2003), pp. 185-207.
76. F. Yates, The design and analysis of factorial experiments, Technical Communication No.35, Commonwealth Bureau of Soil Science, Harpenden, UK, 1937.
77. R.E. Zippel, Probabilistic algorithms for sparse polynomials, Proceedings of the International Symposium on Symbolic and Algebraic Computation, Marseille, France, vol. 72, 1979, pp. 216-226.