Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The problem instance of Vertex Cover consists of an undirected graph G = (V, E) and a positive integer k, the question is whether there exists a subset C ⊆ V of vertices such that each edge in E has at least one of its endpoints in C with |C| ≤ k.  improve two recent worst case upper bounds for Vertex Cover. First, Balasubramanian et al. shod that Vertex Cover can be solved in time O(kn+1:32472kk2), where n is the number of vertices in G. Afterwards, Downey et al. improved this to O(kn+1:31951kk2). Bringing the exponential base significantly below 1:3,  present the new upper bound O(kn+1:29175kk2).
['Rolf Niedermeier', 'Peter Rossmanith']
I am writing a research paper on a idea Upper bounds for vertex cover further improved
[{"from": "human", "value": "I am writing a research paper on a idea Upper bounds for vertex cover further improved"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The problem instance of Vertex Cover consists of an undirected graph G = (V, E) and a positive integer k, the question is whether there exists a subset C \u2286 V of vertices such that each edge in E has at least one of its endpoints in C with |C| \u2264 k.  improve two recent worst case upper bounds for Vertex Cover. First, Balasubramanian et al. shod that Vertex Cover can be solved in time O(kn+1:32472kk2), where n is the number of vertices in G. Afterwards, Downey et al. improved this to O(kn+1:31951kk2). Bringing the exponential base significantly below 1:3,  present the new upper bound O(kn+1:29175kk2)."}]