2 papers
cs.DS2019
5/4 approximation for Symmetric TSP
Alok Chauhan, Madhusudan Verma
Travelling Salesman Problem (TSP) is one of the unsolved problems in computer science. TSP is NP Hard. Till now the best approximation ratio found for symmetric TSP is three by two…
cs.AI2018
Ontology Matching Techniques: A Gold Standard Model
Alok Chauhan, Vijayakumar V, Layth Sliman
Typically an ontology matching technique is a combination of much different type of matchers operating at various abstraction levels such as structure, semantic, syntax, instance e…