An optimum greedy algorithm for choosing minimal set of conflicting constraints in the point sequencing problem
In this work, we first have proposed a technique to define the "causes" of inconsistency on an online point based reasoning constraint network. Second, we introduce an algorithm that proposes the user a minimal set of relations to remove when inconsistencies are detected. We have developed and implemented a battery of algorithms for the purpose of this type of reasoning. Some useful theorems and properties are defined for proving the 'minimal' aspect of the algorithm. Finally, we found that our investigation was a polynomially solvable sub problem of the vertex cover problem.
Launay, F., Mitra, D. (2002). An optimum greedy algorithm for choosing minimal set of conflicting constraints in the point sequencing problem (CS-2002-15). Melbourne, FL. Florida Institute of Technology