文章基本信息

标题：Finding an efficient solution for the maximum number of single source node disjoint paths by enumeration
其他标题：Tek kaynaktan çıkan maksimum sayıdaki tepe ayrık yolların bulunması probleminin sayımlama tekniği ile etkin çözümü
本地全文：下载
作者：Murat Erşen Berberler ; Zeynep Nihan Berberler
期刊名称：Sakarya University Journal of Science
印刷版ISSN：1301-4048
电子版ISSN：2147-835X
出版年度：2015
卷号：19
期号：2
语种：English
出版社：Sakarya University
摘要：The problem of finding node or edge disjoint paths is encountered as a sub problem in many operations research problems such as real time communication, very large scale integration, scheduling, bin packing and load balancing etc. In this paper, due to the majority of application fields, the optimization version for the problem of finding node disjoint paths related to NP_complete class is handled. An algorithm is proposed based on enumeration technique in order to find an exact and efficient solution for the problem of finding maximum number of single source node disjoint paths that is recently tried to overcome by generating approximate solutions by heuristic algorithms due to the complexity class that it belongs to and the method is analyzed in detail.
其他摘要：Tepe ve ayrıt olmak üzere iki türe ayrılan ayrık yolların bulunması problemi ile gerçek zamanlı iletişim, çok geniş ölçekli tümleşim, çizelgeleme, bidon paketleme ve yük dengeleme gibi birçok yöneylem araştırması probleminde alt problem olarak karşılaşılm
关键词：node disjoint paths;maximum independent set;enumeration technique
其他关键词：tepe ayrık yollar;maksimum bağımsız küme;sayımlama tekniği