CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

A New Bit Wise Technique for 3-Partitioning Algorithm

Published on February 2012 by Rajkumar Jain, Narendra S. Chaudhari
journal_cover_thumbnail

Optimization and On-chip Communication
Foundation of Computer Science USA
OOC - Number 1
February 2012
Authors: Rajkumar Jain, Narendra S. Chaudhari
fd99c095-084e-4ea9-9b4a-d2b0c3edf940

Rajkumar Jain, Narendra S. Chaudhari . A New Bit Wise Technique for 3-Partitioning Algorithm. Optimization and On-chip Communication. OOC, 1 (February 2012), 1-5.

@article{
author = { Rajkumar Jain, Narendra S. Chaudhari },
title = { A New Bit Wise Technique for 3-Partitioning Algorithm },
journal = { Optimization and On-chip Communication },
issue_date = { February 2012 },
volume = { OOC },
number = { 1 },
month = { February },
year = { 2012 },
issn = 0975-8887,
pages = { 1-5 },
numpages = 5,
url = { /specialissues/ooc/number1/5463-1001/ },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Special Issue Article
%1 Optimization and On-chip Communication
%A Rajkumar Jain
%A Narendra S. Chaudhari
%T A New Bit Wise Technique for 3-Partitioning Algorithm
%J Optimization and On-chip Communication
%@ 0975-8887
%V OOC
%N 1
%P 1-5
%D 2012
%I International Journal of Computer Applications
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
  1. 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.
  2. Hayes Brian, “The Easiest Hard Problem”, American Scientist, May-June 2002.
  3. 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
  4. 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
  5. Y. G. Saab, “An Effective Multilevel Algorithm for Bisecting Graphs and Hypergraphs”,IEEE Transaction , June 2004, pp. 641-652
  6. M. Dell’Amico, S. Martello, “Reduction of 3-Partition Problem”, Journal of Combinatorial Optimization, 1999, Vol. 3, No. 1, 17-30
  7. R.L. Graham, D.E. Knuth, Oren Patashnik, “Concrete Mathematics-A Foundation for Computer Science”, 2nd Edition, Pearson Education
  8. J.H. Van-Lint, R.M. Wilson, “A course in Combinatorics” 2nd Edition, Cambridge University Press, 2001 pp- 119-128
  9. M. Karp, “Reducibility Among Combinatorial Problems” In R.E. Miller and J.W. Thatcher, eds., Complexity of Computer Computations, 1972, pp. 85-103.
Index Terms

Computer Science
Information Sciences

Keywords

3-BitPartition Rule of Belongingness Optimal Partitioning technique