• Journal of the Korean Operations Research and Management Science Society
• /
• v.29 no.3
• /
• pp.145-155
• /
• 2004

The design of a communication network has long been a challenging optimization problem. Since the optimal design of a network topology is a well known as a NP-complete problem, many researches have been conducted to obtain near optimal solutions in polynomial time instead of exact optimal solutions. All of these researches suggested diverse heuristic algorithms that can be applied to network design problems. Among these algorithms, a simulated annealing algorithm has been proved to guarantee a good solution for many NP-complete problems. in applying the simulated annealing algorithms to network design problems, generating mechanisms for initial solutions and candidate solutions play an important role in terms of goodness of a solution and efficiency. This study aims at analyzing these mechanisms through experiments, and then suggesting reliable mechanisms.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.479-482
• /
• 1998

Whether a given tree is a subgraph of the interconnection network topology is one of the important problem in parallel computing. Trees are used as the underlying structure for divide and conquer algorithms and provide the solution spaces for NP-complete problems. Complete binary trees are the basic structure among those trees. Binomial trees play an important role in broadcasting messages in parallel networks. If binomial trees can be efficiently embedded in complex binary trees, broadcasting algorithms can be effeciently performed on the interconnection networks. In this paper, we present average dilation 2 embedding of binomial trees in complete binary trees.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.4
• /
• pp.155-161
• /
• 2017

This paper suggests polynomial time solution algorithm for Sudoku puzzle problem. This problem has been known NP (non-deterministic polynomial time)-complete. The proposed algorithm set the initial value of blank cells to value range of [$1,2,{\cdots},9$]. Then the candidate set values in blank cells deleted by preassigned clue in row, column, and block. We apply the basic rules of Stuart, and proposes two additional rules. Finally we apply binary backtracking(BBT) technique. For the experimental Sudoku puzzle with various categories of solution, the BBT algorithm can be obtain all of given Sudoku puzzle regardless of any types of solution.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.5C
• /
• pp.422-434
• /
• 2002

We propose 3-layered hierarchical fiber-optic backbone transmission network composed of B-DCS, Backbone ring, Edge ring for efficient transmission of high capacity traffic and consider design method to ensure network survivability of each layer at affordable cost. Mathematical ring-construction cost minimization using MIP(Mixed Integer Programming) models results in NP-complete problem. So, it is hard to solve it within reasonable computing time. on a large-scale network. Therefore we develop heuristic algorithms solving WSCAP(Working and Spared Channel Assignment Problem) for B-DCS, MRLB(Multi-Ring Load Balancing) problem for Backbone ring, and ORLB(Overlayed Ring Load Balancing) problem for Edge ring and show their usefulness through case study.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.9
• /
• pp.79-84
• /
• 2016

In this paper we consider the problem of finding the triplet (S,${\pi}$,f), where $S{\subseteq}V$, ${\pi}$ is a sequence of nodes in S and $f:V{\backslash}S{\rightarrow}S$ for a given complete graph G=(V,E). In particular, there exist two costs, $c^V_{uv}$ and $c^D_{uv}$ for $(u,v){\in}E$, and the cost of triplet (S,${\pi}$,f) is defined as $\sum_{i=1}^{{\mid}S{\mid}}c^V_{{\pi}(i){\pi}(i+1)}+2$ ${\sum_{u{\in}V{\backslash}S}c^D_{uf(u)}$. This problem is motivated by the integrated routing of the vehicle and drone for urban delivery services. Since a well-known NP-complete TSP (Traveling Salesman Problem) is a special case of our problem, we cannot expect to have any polynomial-time algorithm unless P=NP. Furthermore, for practical purposes, we may not rely on time-exhaustive enumeration method such as branch-and-bound and branch-and-cut. This paper suggests the simple heuristic which is motivated by the MST (minimum spanning tree)-based approximation algorithm and neighborhood search heuristic for TSP.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.7
• /
• pp.377-383
• /
• 2002

The TSP(Traveling Salesman Problem) has been known as NP-complete, there have been various studies to find the near optimal solution. The nearest neighbor heuristic is more simple than the other algorithms which are to find the optimal solution. This paper designs and implements a new distributed nearest neighbor heuristic with bounding function for the TSP using the master/slave model of PVM(Parallel Virtual Machine). Distributed genetic algorithm obtains a near optimal solution and distributed nearest neighbor heuristic finds an optimal solution for the TSP using the near optimal value obtained by distributed genetic algorithm as the initial bounding value. Especially, we get more speedup using a new genetic operator in the genetic algorithm.

• Journal of Internet Computing and Services
• /
• v.5 no.5
• /
• pp.129-138
• /
• 2004

In the telecommunications network, multicasting is widely used recently. Multicast tree problem is modeled as the NP-complete Steiner problem in the networks. In this paper, we study algorithms for finding efficient multicast trees with hop and node degree constraints. Multimedia service is an application of multicasting and it is required to transfer a large volume of multimedia data with QoS(Quality of Service). Though heuristics for solving the multicast tree problems with one constraint have been studied. however, there is no optimum algorithm that finds an optimum multicast tree with hop and node degree constraints up to now. In this paper, an approach for finding an efficient multicast tree that satisfies hop and node degree constraints is presented and the experimental results explain how the hop and node degree constraints affect to the total cost of a multicast tree.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.1 no.1
• /
• pp.16-28
• /
• 1991

Knapsack public-key cryptosystems are based on the knapsack problem which is NP-complete. aii of the knapsack problem, are known to be insecure. However, the Chor and Rivest knapsack cryptosystem based on arithmetic in finite field is secure against all known cryptosystem based on arithmetic in a finite field is secure against all known cryptanalytic attacks. We suggest a new msthod of attack on knapsack cryptosystem which is based on the relaxation of a quadratic 0-1 integer optimization problem. We show that under certain condirions some bits of the solution of knapsack problem can be determined by using persistency property of linear relaxation. Also we propose a new Chor-Rivest system, this new cryptosystem reduces the number of calculation of discrete logarithms which are necessary for the implemention in a multi-user system.

• Journal of Korea Multimedia Society
• /
• v.19 no.2
• /
• pp.443-450
• /
• 2016

This paper deals with a kind of packing problem of which the goal is to compose one or more templates which will be used to produce the items of different types. Each template consists of a fixed number of slots which are assigned to the different types of items and the production of the items is accomplished by printing the template repeatedly. The objective is to minimize the total number of produced items. This problem is known to be NP-hard. We present a polynomial time approximation algorithm which has a constant approximation ratio. The proposed algorithm is based on the well-known first-fit strategy.

• Journal of applied mathematics & informatics
• /
• v.20 no.1_2
• /
• pp.181-195
• /
• 2006

Resource-constrained project scheduling problems with variant processes can be represented and solved using a logic-based terminological language called RSV (resource constrained project scheduling with variant processes). We consider three different variants for formalizing the RSV-scheduling problem, the optimizing variant, the number variant and the decision variant. Using the decision variant we show that the RSV- problem is NP-complete. Further we show that the optimizing variant (or number variant) of the RSV-problem is computable in polynomial time iff. the decision variant is computable in polynomial time.