Improved approximation algorithms for some min–max postmen cover problems with applications to the min–max subtree cover

IF 0.9 4区数学 Q3 MATHEMATICS, APPLIED

Mathematical Methods of Operations Research Pub Date : 2022-12-07 DOI:10.1007/s00186-022-00807-8

Wei Yu

引用次数: 0

查看原文本刊更多论文

一些最小最大邮差覆盖问题的改进逼近算法及其在最小最大子树覆盖上的应用

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Mathematical Methods of Operations Research 数学-应用数学

CiteScore

1.90

自引率

0.00%

发文量

审稿时长

>12 weeks

期刊介绍： This peer reviewed journal publishes original and high-quality articles on important mathematical and computational aspects of operations research, in particular in the areas of continuous and discrete mathematical optimization, stochastics, and game theory. Theoretically oriented papers are supposed to include explicit motivations of assumptions and results, while application oriented papers need to contain substantial mathematical contributions. Suggestions for algorithms should be accompanied with numerical evidence for their superiority over state-of-the-art methods. Articles must be of interest for a large audience in operations research, written in clear and correct English, and typeset in LaTeX. A special section contains invited tutorial papers on advanced mathematical or computational aspects of operations research, aiming at making such methodologies accessible for a wider audience. All papers are refereed. The emphasis is on originality, quality, and importance.