Trimming of finite subsets of the Manhattan plane

IF 1.6 4区数学 Q3 MATHEMATICS, APPLIED Discrete Optimization Pub Date : 2025-03-01 DOI:10.1016/j.disopt.2025.100880

Gökçe Çakmak , Ali Deniz , Şahin Koçak

引用次数: 0

Abstract

V. Turaev defined recently an operation of “Trimming” for pseudo-metric spaces and analyzed the tight span of (pseudo-)metric spaces via this process. In this work we investigate the trimming of finite subspaces of the Manhattan plane. We show that this operation amounts for them to taking the metric center set and we give an algorithm to construct the tight spans via trimming.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

曼哈顿平面有限子集的修剪

V. Turaev最近定义了伪度量空间的“修剪”操作，并通过此过程分析了（伪）度量空间的紧跨度。在这项工作中，我们研究了曼哈顿平面的有限子空间的修剪。我们证明了这种操作相当于取度量中心集，并给出了一种通过切边构造紧跨的算法。

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

求助全文

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

来源期刊

Discrete Optimization 管理科学-应用数学

CiteScore

2.10

自引率

9.10%

发文量

审稿时长

>12 weeks

期刊介绍： Discrete Optimization publishes research papers on the mathematical, computational and applied aspects of all areas of integer programming and combinatorial optimization. In addition to reports on mathematical results pertinent to discrete optimization, the journal welcomes submissions on algorithmic developments, computational experiments, and novel applications (in particular, large-scale and real-time applications). The journal also publishes clearly labelled surveys, reviews, short notes, and open problems. Manuscripts submitted for possible publication to Discrete Optimization should report on original research, should not have been previously published, and should not be under consideration for publication by any other journal.

期刊最新文献

Valid inequalities for the Time-Indexed Non-Preemptive Single Machine Scheduling Problem On the number of independent sets in Halin graphs Column (and row) generation algorithms for the pallet loading problem Exploiting symmetries in optimal quantum circuit design Editorial Board