A Distributed Constraint Optimization Problem (DCOP) is a fundamental problem that can formalize various applications related to multi-agent cooperation. Considering pseudo-tree based search algorithms is important in DCOPs, since their memory requirements are polynomial in the number of agents. However, these algorithms require a large run time. Thus, how to speed up pseudo-tree based search a...

Robust optimization is a widely studied area in operations research, where the algorithm takes as input range of values and outputs single solution that performs well for entire range. Specifically, robust aims to minimize regret , defined maximum difference between solution’s cost an optimal hindsight once has been realized. For graph problems P such shortest path minimum spanning tree, polyno...

In the Priority Steiner Tree (PST) problem, we are given an undirected graph \(G=(V,E)\) with a source \(s \in V\) and terminals \(T \subseteq V \setminus \{s\}\), where each terminal \(v T\) requires nonnegative priority P(v). The goal is to compute minimum weight tree containing edges of varying rates such that path from s v consists rate greater than or equal PST problem k priorities admits ...

We consider a generalization of the classical minimum spanning tree problem called the generalized minimum spanning tree problem and denoted by GMST problem. The aim of this paper is to present an exact exponential time algorithm for the GMST problem as well three heuristic algorithms, two of them based on Prim’s and Kruskal’s algorithms for the minimum spanning tree problem and one based on th...

Among progressive 3D mesh compression algorithms, the kd-tree-based algorithm proposed by Gandoin and Devillers [1] is one of the state-of-the-art algorithms. Based on the observation that this geometry coder has a large amount of overhead at high kd-tree levels, we propose an octree-based geometry coder that demands a less amount of coding bits at high octree levels by applying selective cell ...

Decision trees have been widely used in data mining andmachine learning as a comprehensible knowledge representation. While ant colony optimization (ACO) algorithms have been successfully applied to extract classification rules, decision tree induction with ACO algorithms remains an almost unexplored research area. In this paper we propose a novel ACO algorithm to induce decision trees, combini...