{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T09:37:33Z","timestamp":1648633053914},"reference-count":5,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2013,1]]},"abstract":"<jats:p> We consider the problem of computing a minimum-weight Hamiltonian cycle on an undirected graph with edges' weights from set {0, 1, 2}, where 0-weight edges create a perfect matching of the graph. We provide a (4\/3)-approximation algorithm and show that the problem is APX-complete. <\/jats:p>","DOI":"10.1142\/s0129054113500019","type":"journal-article","created":{"date-parts":[[2013,5,14]],"date-time":"2013-05-14T06:54:44Z","timestamp":1368514484000},"page":"95-108","source":"Crossref","is-referenced-by-count":3,"title":["(1,2)-HAMILTONIAN COMPLETION ON A MATCHING"],"prefix":"10.1142","volume":"24","author":[{"given":"MARCIN","family":"BIENKOWSKI","sequence":"first","affiliation":[{"name":"Institute of Computer Science, University of Wroclaw, Joliot-Curie 15, 50-383 Wroclaw, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"PAWE\u0141","family":"ZALEWSKI","sequence":"additional","affiliation":[{"name":"Institute of Computer Science, University of Wroclaw, Joliot-Curie 15, 50-383 Wroclaw, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2013,5,13]]},"reference":[{"key":"p_4","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-004-1131-0"},{"key":"p_9","doi-asserted-by":"publisher","DOI":"10.1287\/moor.18.1.1"},{"key":"p_11","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1954-033-3"},{"key":"p_12","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90103-3"},{"key":"p_13","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.03.043"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054113500019","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T14:45:24Z","timestamp":1565189124000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054113500019"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1]]},"references-count":5,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2013,5,13]]},"published-print":{"date-parts":[[2013,1]]}},"alternative-id":["10.1142\/S0129054113500019"],"URL":"https:\/\/doi.org\/10.1142\/s0129054113500019","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,1]]}}}