The debts' clearing problem: a new approach
Data Structures and Algorithms
2011-11-17 v1
Abstract
The debts' clearing problem is about clearing all the debts in a group of entities (e.g. persons, companies) using a minimal number of money transaction operations. In our previous works we studied the problem, gave a dynamic programming solution solving it and proved that it is NP-hard. In this paper we adapt the problem to dynamic graphs and give a data structure to solve it. Based on this data structure we develop a new algorithm, that improves our previous one for the static version of the problem.
Keywords
Cite
@article{arxiv.1111.3663,
title = {The debts' clearing problem: a new approach},
author = {C. Pătcaş},
journal= {arXiv preprint arXiv:1111.3663},
year = {2011}
}