Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Minimum-ight triangulation (MWT) is NP-hard. It has a polynomial-time constant-factor approximation algorithm, and a variety of effective polynomial-time heuristics that, for many instances, can find the exact MWT. Linear programs (LPs) for MWT are ll-studied, but previously no connection was known beten any LP and any approximation algorithm or heuristic for MWT. Here  show the first such connections: for an LP formulation due to Dantzig et al. (1985): (i) the integrality gap is bounded by a constant; (ii) given any instance, if the aforementioned heuristics find the MWT, then so does the LP.
['Arman Yousefi', 'Neal E. Young']
I am writing a research paper on a idea On a linear program for minimum-weight triangulation
[{"from": "human", "value": "I am writing a research paper on a idea On a linear program for minimum-weight triangulation"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Minimum-ight triangulation (MWT) is NP-hard. It has a polynomial-time constant-factor approximation algorithm, and a variety of effective polynomial-time heuristics that, for many instances, can find the exact MWT. Linear programs (LPs) for MWT are ll-studied, but previously no connection was known beten any LP and any approximation algorithm or heuristic for MWT. Here  show the first such connections: for an LP formulation due to Dantzig et al. (1985): (i) the integrality gap is bounded by a constant; (ii) given any instance, if the aforementioned heuristics find the MWT, then so does the LP."}]