A dual feasible forest algorithm for the linear assignment problem
M. Akgül, O. Ekin (1991)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
M. Akgül, O. Ekin (1991)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Konstantinos Paparrizos (1996)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Vassilev, Tzvetalin, Ammerlaan, Joanna (2013)
Serdica Journal of Computing
Similarity:
ACM Computing Classification System (1998): G.2.2, F.2.2. Recently, Markov, Vassilev and Manev [2] proposed an algorithm for finding the longest path in 2-trees. In this paper, we describe an implementation of the algorithm. We briefly discuss the algorithm and present example that helps the reader grasp the main algorithmic ideas. Further, we discuss the important stages in the implementation of the algorithm and justify the decisions taken. Then, we present experimental...
Viet Hung Nguyen (2007)
RAIRO - Operations Research
Similarity:
Given a weighted undirected graph , a tree (respectively tour) cover of an edge-weighted graph is a set of edges which forms a tree (resp. closed walk) and covers every other edge in the graph. The tree (resp. tour) cover problem is of finding a minimum weight tree (resp. tour) cover of . Arkin, Halldórsson and Hassin (1993) give approximation algorithms with factors respectively 3.5 and 5.5. Later Könemann, Konjevod, Parekh, and Sinha (2003) study the linear programming relaxations...
Bonichon, Nicolas, Gavoille, Cyril, Hanusse, Nicolas (2005)
Journal of Graph Algorithms and Applications
Similarity:
Zsakó, László (2006)
Annales Mathematicae et Informaticae
Similarity:
Štefan Berežný, Vladimír Lacko (2005)
Kybernetika
Similarity:
Suppose a graph whose edges are partitioned into disjoint categories (colors) is given. In the color-balanced spanning tree problem a spanning tree is looked for that minimizes the variability in the number of edges from different categories. We show that polynomiality of this problem depends on the number of categories and present some polynomial algorithm.
Dionisio Pérez-Brito, Nenad Mladenović, José A. Moreno-Pérez (1998)
The Yugoslav Journal of Operations Research
Similarity:
Nardelli, Enrico, Proietti, Guido, Widmayer, Peter (2001)
Journal of Graph Algorithms and Applications
Similarity:
Bar-Yehuda, Reuven, Even, Guy, Feldmann, Jon, Naor, Joseph (2001)
Journal of Graph Algorithms and Applications
Similarity: