• IE interfaces
• /
• v.21 no.1
• /
• pp.1-7
• /
• 2008

In this paper we study the Minimum Edge Addition Problem(MEAP) to decrease the diameter of a graph. MEAP can be used for improving the serviceability of telecommunication networks with a minimum investment. MEAP is an NP-hard optimization problem. We present two mathematical programming models : One is a multi-commodity flow formulation and the other is a path partition formulation. We propose a branch-and-price algorithm to solve the path partition formulation to the optimality. We develop a polynomial time column generation sub-routine conserving the mathematical structure of a sub problem for the path partition formulation. Computational experiments show that the path partition formulation is better than the multi-commodity flow formulation. The branch-and-price algorithm can find the optimal solutions for the immediate size graphs within reasonable time.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2022.07a
• /
• pp.621-623
• /
• 2022

본 논문은 FEC (Fog Edge Computing) 환경의 모바일 장치에서 요구되는 서비스의 구현 모듈을 에지 서버에 부분 오프로딩하기 위하여, 서비스 구현 모듈의 DAG 토폴로지에 포함된 분기구조의 분할 방법을 제안한다. 제안 방법은 최소-컷 문제를 적용하여 분기구조들의 오프로딩 여부 결정, 부분 모듈들의 실행위치 결정 및 최적 실행경로 추출에 유용하게 사용된다.