Exact and heuristic algorithms for Space Information Flow
نویسندگان
چکیده
منابع مشابه
Exact and heuristic algorithms for Space Information Flow
Space Information Flow (SIF) is a new promising research area that studies network coding in geometric space, such as Euclidean space. The design of algorithms that compute the optimal SIF solutions remains one of the key open problems in SIF. This work proposes the first exact SIF algorithm and a heuristic SIF algorithm that compute min-cost multicast network coding for N (N ≥ 3) given termina...
متن کاملHeuristic and exact algorithms for Generalized Bin Covering Problem
In this paper, we study the Generalized Bin Covering problem. For this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. To nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. By computational experiments, the eciency of the heuristic algorithm is assessed.
متن کاملheuristic and exact algorithms for generalized bin covering problem
in this paper, we study the generalized bin covering problem. for this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. to nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. by computational experiments, the eciency of the heuristic algorithm is assessed.
متن کاملExact and heuristic algorithms for Cograph Editing
We present a dynamic programming algorithm for optimally solving the Cograph Editing problem on an n-vertex graph that runs in O(3n) time and uses O(2) space. In this problem, we are given a graph G = (V,E) and the task is to find a smallest possible set F ⊆ V × V of vertex pairs such that (V,E4F ) is a cograph (or P4-free graph), where 4 represents the symmetric difference operator. We also de...
متن کاملExact and Heuristic Algorithms for Dynamic Tree Simplification
The Tree Knapsack Problem (TKP) is a 0–1 integer programming problem where hierarchy constraints are enforced. If a node is selected for packing into the knapsack, all the ancestor nodes on the path from the root to the selected node are packed as well. One apparent application of this problem is the simplification of computer graphics models. Real applications also use alternative representati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PLOS ONE
سال: 2018
ISSN: 1932-6203
DOI: 10.1371/journal.pone.0193350