Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  discuss two flexibility metrics for Simple Temporal Networks (STNs): the so-called naive flexibility metric based on the difference beten earliest and latest starting times of temporal variables, and a recently proposed concurrent flexibility metric.  establish an interesting connection beten the computation of these flexibility metrics and properties of the minimal distance matrix DS of an STN S: the concurrent flexibility metric can be computed by finding a minimum ight matching of a ighted bipartite graph completely specified by DS, while the naive flexibility metric corresponds to computing a maximum ight matching in the same graph. From a practical point of view this correspondence offers an advantage: instead of using an O(n5) LP-based approach, reducing the problem to a matching problem  derive an O(n3) algorithm for computing the concurrent flexibility metric.
['Simon Mountakis', 'Tomas Klos', 'Cees Witteveen']
I am writing a research paper on a idea Temporal flexibility revisited: maximizing flexibility by computing bipartite matchings
[{"from": "human", "value": "I am writing a research paper on a idea Temporal flexibility revisited: maximizing flexibility by computing bipartite matchings"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  discuss two flexibility metrics for Simple Temporal Networks (STNs): the so-called naive flexibility metric based on the difference beten earliest and latest starting times of temporal variables, and a recently proposed concurrent flexibility metric.  establish an interesting connection beten the computation of these flexibility metrics and properties of the minimal distance matrix DS of an STN S: the concurrent flexibility metric can be computed by finding a minimum ight matching of a ighted bipartite graph completely specified by DS, while the naive flexibility metric corresponds to computing a maximum ight matching in the same graph. From a practical point of view this correspondence offers an advantage: instead of using an O(n5) LP-based approach, reducing the problem to a matching problem  derive an O(n3) algorithm for computing the concurrent flexibility metric."}]