{"_id":"zMeyxB3nXPvJPieY3","bibbaseid":"gaur-krishnamurti-simpleapproximationalgorithmsformaxnaespandhypergraph2colorability-2000","downloads":0,"creationDate":"2016-08-24T20:52:54.220Z","title":"Simple approximation algorithms for MAXNAESP and hypergraph 2-colorability","author_short":["Gaur, D.","Krishnamurti, R"],"year":2000,"bibtype":"article","biburl":"http://www.cs.uleth.ca/~gaur/selfpubs.bib","bibdata":{"bibtype":"article","type":"article","title":"Simple approximation algorithms for MAXNAESP and hypergraph 2-colorability","author":[{"propositions":[],"lastnames":["Gaur"],"firstnames":["DR"],"suffixes":[]},{"propositions":[],"lastnames":["Krishnamurti"],"firstnames":["R"],"suffixes":[]}],"journal":"ALGORITHMS AND COMPUTATIONS","volume":"1741","pages":"49--55","year":"2000","publisher":"SPRINGER-VERLAG BERLIN HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY","bibtex":"@article{gaur2000simple,\n title={Simple approximation algorithms for MAXNAESP and hypergraph 2-colorability},\n author={Gaur, DR and Krishnamurti, R},\n journal={ALGORITHMS AND COMPUTATIONS},\n volume={1741},\n pages={49--55},\n year={2000},\n publisher={SPRINGER-VERLAG BERLIN HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY}\n}\n\n","author_short":["Gaur, D.","Krishnamurti, R"],"key":"gaur2000simple","id":"gaur2000simple","bibbaseid":"gaur-krishnamurti-simpleapproximationalgorithmsformaxnaespandhypergraph2colorability-2000","role":"author","urls":{},"downloads":0,"html":""},"search_terms":["simple","approximation","algorithms","maxnaesp","hypergraph","colorability","gaur","krishnamurti"],"keywords":[],"authorIDs":["57be0926fd16738355000363"],"dataSources":["AYQTvzz9TQ9g4Dewi"]}