Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: In a max-min LP, the objective is to maximise ω subject to  A  x  ≤  1 ,  C  x  ≥ ω 1 , and  x  ≥ 0 for nonnegative matrices  A  and  C .  present a local algorithm (constant-time distributed algorithm) for approximating max-min LPs. The approximation ratio of our algorithm is the best possible for any local algorithm; there is a matching unconditional lor bound.
['Patrik Floréen', 'Joel Kaasinen', 'Petteri Kaski', 'Jukka Suomela']
I am writing a research paper on a idea An optimal local approximation algorithm for max-min linear programs
[{"from": "human", "value": "I am writing a research paper on a idea An optimal local approximation algorithm for max-min linear programs"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: In a max-min LP, the objective is to maximise \u03c9 subject to  A  x  \u2264  1 ,  C  x  \u2265 \u03c9 1 , and  x  \u2265 0 for nonnegative matrices  A  and  C .  present a local algorithm (constant-time distributed algorithm) for approximating max-min LPs. The approximation ratio of our algorithm is the best possible for any local algorithm; there is a matching unconditional lor bound."}]