Call for Paper - May 2015 Edition
IJCA solicits original research papers for the May 2015 Edition. Last date of manuscript submission is April 20, 2015. Read More
A New Bit Wise Technique for 3-Partitioning Algorithm
IJCA Special Issue on Optimization and On-chip Communication
© 2012 by IJCA Journal
ooc - Number 1
Year of Publication: 2012
Rajkumar Jain and Narendra S Chaudhari. Article: A New Bit Wise Technique for 3-Partitioning Algorithm. IJCA Special Issue on Optimization and On-chip Communication ooc(1):1-5, February 2012. Full text available. BibTeX
@article{key:article,
author = {Rajkumar Jain and Narendra S. Chaudhari},
title = {Article: A New Bit Wise Technique for 3-Partitioning Algorithm},
journal = {IJCA Special Issue on Optimization and On-chip Communication},
year = {2012},
volume = {ooc},
number = {1},
pages = {1-5},
month = {February},
note = {Full text available}
}
Abstract
From last five decades peoples are working on Partitioning problem. Partitioning is a fundamental problem with applications in several fields of study. The 3-partition problem is one of the most famous strongly NP-complete combinatorial problems in computer science [1]. Most of the existing partitioning algorithms are heuristics in nature
References
- M.R.Garey and D.S. Johnson, Computers and Intractability: A guide to the theory of NP-Completeness, W.H. Freeman and Co., New York, 1979.
- Hayes Brian, “The Easiest Hard Problem”, American Scientist, May-June 2002.
- Zuckerman, D, “NP-complete problems have a version that's hard to approximate”, Structure in Complexity Theory Conference, 1993., Proceedings of the Eighth Annual, IEEE, 1993 , pp 305 - 312
- C. Ding, H. Xiaofeng, Z. Hongyuan, G. Ming, and H. Simon, “A Min-Max Cut Algorithm for Graph Partitioning and Data Clustering,” Proc. IEEE International Conference Data Mining, pp. 107-114, 2001
- Y. G. Saab, “An Effective Multilevel Algorithm for Bisecting Graphs and Hypergraphs”,IEEE Transaction , June 2004, pp. 641-652
- M. Dell’Amico, S. Martello, “Reduction of 3-Partition Problem”, Journal of Combinatorial Optimization, 1999, Vol. 3, No. 1, 17-30
- R.L. Graham, D.E. Knuth, Oren Patashnik, “Concrete Mathematics-A Foundation for Computer Science”, 2nd Edition, Pearson Education
- J.H. Van-Lint, R.M. Wilson, “A course in Combinatorics” 2nd Edition, Cambridge University Press, 2001 pp- 119-128
- M. Karp, “Reducibility Among Combinatorial Problems” In R.E. Miller and J.W. Thatcher, eds., Complexity of Computer Computations, 1972, pp. 85-103.