{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T05:09:07Z","timestamp":1755925747248},"reference-count":15,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2013,7,1]],"date-time":"2013-07-01T00:00:00Z","timestamp":1372636800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1016\/j.orl.2013.03.004","type":"journal-article","created":{"date-parts":[[2013,3,22]],"date-time":"2013-03-22T17:03:19Z","timestamp":1363971799000},"page":"321-324","source":"Crossref","is-referenced-by-count":1,"title":["Approximating max\u2013min weighted -joins"],"prefix":"10.1016","volume":"41","author":[{"given":"Satoru","family":"Iwata","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Ravi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1\u20133","key":"10.1016\/j.orl.2013.03.004_br000005","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0166-218X(00)00355-3","article-title":"Complexity of finding a join of maximum weight","volume":"114","author":"Ageev","year":"2001","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.orl.2013.03.004_br000010","unstructured":"N. Christofides, Worst-case analysis of a new heuristic for the travelling salesman problem, Tech. Rep. 388, Graduate School of Industrial Administration, Carnegie Mellon University, 1976."},{"key":"10.1016\/j.orl.2013.03.004_br000015","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/BF01580113","article-title":"Matchings, Euler tours, and the Chinese postman problem","volume":"5","author":"Edmonds","year":"1973","journal-title":"Math. Program."},{"key":"10.1016\/j.orl.2013.03.004_br000020","doi-asserted-by":"crossref","unstructured":"U. Feige, K. Jain, M. Mahdian, V. Mirrokni, Robust combinatorial optimization with exponential scenarios, in: IPCO, 2007, pp. 439\u2013453.","DOI":"10.1007\/978-3-540-72792-7_33"},{"key":"10.1016\/j.orl.2013.03.004_br000025","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/BFb0121195","article-title":"An analysis of approximations for maximizing submodular set functions II","volume":"8","author":"Fisher","year":"1978","journal-title":"Math. Program. Stud."},{"issue":"1","key":"10.1016\/j.orl.2013.03.004_br000030","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF01202790","article-title":"Conservative weightings and ear-decompositions of graphs","volume":"13","author":"Frank","year":"1993","journal-title":"Combinatorica"},{"issue":"2","key":"10.1016\/j.orl.2013.03.004_br000035","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1137\/S0097539793242618","article-title":"A general approximation technique for constrained forest problems","volume":"24","author":"Goemans","year":"1995","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.orl.2013.03.004_br000040","series-title":"Geometric Algorithms and Combinatorial Optimization","author":"Gr\u00f6tschel","year":"1988"},{"key":"10.1016\/j.orl.2013.03.004_br000045","series-title":"ICALP (1)","first-page":"262","article-title":"Thresholded covering algorithms for robust and max\u2013min optimization","volume":"vol. 6198","author":"Gupta","year":"2010"},{"issue":"3","key":"10.1016\/j.orl.2013.03.004_br000050","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1145\/5925.5933","article-title":"A unified approach to approximation algorithms for bottleneck problems","volume":"33","author":"Hochbaum","year":"1986","journal-title":"J. ACM"},{"key":"10.1016\/j.orl.2013.03.004_br000055","series-title":"Combinatorics","first-page":"309","article-title":"How to tidy up your set-system?","volume":"vol. 52","author":"Hurkens","year":"1988"},{"key":"10.1016\/j.orl.2013.03.004_br000060","first-page":"568","article-title":"Fairness in routing and load balancing","author":"Kleinberg","year":"1999","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/j.orl.2013.03.004_br000065","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01588971","article-title":"An analysis of approximations for maximizing submodular set functions I","volume":"14","author":"Nemhauser","year":"1978","journal-title":"Math. Program."},{"key":"10.1016\/j.orl.2013.03.004_br000070","unstructured":"A. Seb\u0151, Max\u2013min weighted T-join is NP-hard on a cycle, June 2011, personal communication."},{"key":"10.1016\/j.orl.2013.03.004_br000075","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1023\/A:1022601301102","article-title":"Min-max optimization of several classical discrete optimization problems","volume":"98","author":"Yu","year":"1998","journal-title":"J. Optim. Theory Appl."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0167637713000333?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0167637713000333?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,7,11]],"date-time":"2019-07-11T07:46:39Z","timestamp":1562831199000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637713000333"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["S0167637713000333"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.orl.2013.03.004","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2013,7]]}}}