Journal of Combinatorial Optimization最新文献_第5页

Optimizing hospital bed allocation for coordinated medical efficiency and quality improvement 优化医院床位分配，协调医疗效率和质量改进

IF 1 4区数学

Journal of Combinatorial Optimization Pub Date : 2024-10-21 DOI: 10.1007/s10878-024-01210-1

Haiyue Yu, Ting Shen, Liwei Zhong

引用次数: 0

The hamiltonian path graph is connected for simple s, t paths in rectangular grid graphs 对于矩形网格图中简单的 s、t 路径，哈密顿路径图是连通的

IF 1 4区数学

Journal of Combinatorial Optimization Pub Date : 2024-10-19 DOI: 10.1007/s10878-024-01207-w

Rahnuma Islam Nishat, Venkatesh Srinivasan, Sue Whitesides

{"title":"The hamiltonian path graph is connected for simple s, t paths in rectangular grid graphs","authors":"Rahnuma Islam Nishat, Venkatesh Srinivasan, Sue Whitesides","doi":"10.1007/s10878-024-01207-w","DOIUrl":"https://doi.org/10.1007/s10878-024-01207-w","url":null,"abstract":"An s, t Hamiltonian path P for an (m times n) rectangular grid graph (mathbb {G}) is a Hamiltonian path from the top-left corner s to the bottom-right corner t. We define an operation “square-switch” on s, t Hamiltonian paths P affecting only those edges of P that lie in some small (2 units by 2 units) square subgrid of (mathbb {G}). We prove that when applied to suitable locations, the result of the square-switch is another s, t Hamiltonian path. Then we use square-switch to achieve a reconfiguration result for a subfamily of s, t Hamiltonian paths we call simple paths, that has the minimum number of bends for each maximal internal subpath connecting any two vertices on the boundary of the grid graph. We give an algorithmic proof that the Hamiltonian path graph (mathcal {G}) whose vertices represent simple paths is connected when edges arise from the square-switch operation: our algorithm reconfigures any given initial simple path P to any given target simple path (P') in (mathcal {O})(( |P |)) time and (mathcal {O})(( |P |)) space using at most ({5} |P |/ {4}) square-switches, where ( |P |= m times n) is the number of vertices in the grid graph (mathbb {G}) and hence in any Hamiltonian path P for (mathbb {G}). Thus the diameter of the simple path graph (mathcal {G}) is at most 5mn/ 4 for the square-switch operation, which we show is asymptotically tight for this operation.\u0000","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"372 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2024-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142451395","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Efficient heuristics to compute minimal and stable feedback arc sets 计算最小和稳定反馈弧集的高效启发式方法

IF 1 4区数学

Journal of Combinatorial Optimization Pub Date : 2024-10-15 DOI: 10.1007/s10878-024-01209-8

Claudia Cavallaro, Vincenzo Cutello, Mario Pavone

引用次数: 0

Explicit construction of mixed dominating sets in generalized Petersen graphs 广义彼得森图中混合支配集的显式构造

IF 1 4区数学

Journal of Combinatorial Optimization Pub Date : 2024-10-14 DOI: 10.1007/s10878-024-01222-x

Meysam Rajaati Bavil Olyaei, Mohsen Alambardar Meybodi, Mohammad Reza Hooshmandasl, Ali Shakiba

引用次数: 0

New approximations for monotone submodular maximization with knapsack constraint 带 Knapsack 约束的单调亚模块最大化的新近似值

IF 1 4区数学

Journal of Combinatorial Optimization Pub Date : 2024-10-13 DOI: 10.1007/s10878-024-01214-x

Hongmin W. Du, Xiang Li, Guanghua Wang

引用次数: 0

Approximate weak efficiency of the set-valued optimization problem with variable ordering structures 具有可变排序结构的集值优化问题的近似弱效率

IF 1 4区数学

Journal of Combinatorial Optimization Pub Date : 2024-10-12 DOI: 10.1007/s10878-024-01211-0

Zhiang Zhou, Wenbin Wei, Fei Huang, Kequan Zhao

引用次数: 0

A common generalization of budget games and congestion games 预算博弈和拥挤博弈的共同概括

IF 1 4区数学

Journal of Combinatorial Optimization Pub Date : 2024-10-11 DOI: 10.1007/s10878-024-01218-7

Fuga Kiyosue, Kenjiro Takazawa

{"title":"A common generalization of budget games and congestion games","authors":"Fuga Kiyosue, Kenjiro Takazawa","doi":"10.1007/s10878-024-01218-7","DOIUrl":"https://doi.org/10.1007/s10878-024-01218-7","url":null,"abstract":"Budget games were introduced by Drees, Riechers, and Skopalik (2014) as a model of noncooperative games arising from resource allocation problems. Budget games have several similarities to congestion games, one of which is that the matroid structure of the strategy space is essential for the existence of a pure Nash equilibrium (PNE). Despite these similarities, however, the theoretical relation between budget games and congestion games has been unclear. In this paper, we provide a common generalization of budget games and congestion games, called generalized budget games (g-budget games, for short), to establish a large class of noncooperative games retaining the nice property of the matroid structure. We show that the model of g-budget games includes weighted congestion games and player-specific congestion games under certain assumptions. We further show that g-budget games also include offset budget games, a generalized model of budget games by Drees, Feldotto, Riechers, and Skopalik (2019). We then prove that every matroid g-budget game has a PNE, which extends the result for budget games. We finally a PNE in a certain class of singleton g-budget games can be computed in a greedy manner.\u0000","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"12 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2024-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142415784","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Algorithmic study on liar’s vertex-edge domination problem 骗子顶点边缘支配问题的算法研究

IF 1 4区数学

Journal of Combinatorial Optimization Pub Date : 2024-10-11 DOI: 10.1007/s10878-024-01208-9

Debojyoti Bhattacharya, Subhabrata Paul

{"title":"Algorithmic study on liar’s vertex-edge domination problem","authors":"Debojyoti Bhattacharya, Subhabrata Paul","doi":"10.1007/s10878-024-01208-9","DOIUrl":"https://doi.org/10.1007/s10878-024-01208-9","url":null,"abstract":"Let (G=(V,E)) be a graph. For an edge (e=xyin E), the closed neighbourhood of e, denoted by (N_G[e]) or (N_G[xy]), is the set (N_G[x]cup N_G[y]). A vertex set (Lsubseteq V) is liar’s vertex-edge dominating set of a graph (G=(V,E)) if for every (e_iin E), (|N_G[e_i]cap L|ge 2) and for every pair of distinct edges (e_i) and (e_j), (|(N_G[e_i]cup N_G[e_j])cap L|ge 3). This paper introduces the notion of liar’s vertex-edge domination which arises naturally from some applications in communication networks. Given a graph G, the Minimum Liar’s Vertex-Edge Domination Problem (MinLVEDP) asks to find a liar’s vertex-edge dominating set of G of minimum cardinality. In this paper, we study this problem from an algorithmic point of view. We show that MinLVEDP can be solved in linear time for trees, whereas the decision version of this problem is NP-complete for general graphs, chordal graphs, and bipartite graphs. We further study approximation algorithms for this problem. We propose two approximation algorithms for MinLVEDP in general graphs and p-claw free graphs. On the negative side, we show that the MinLVEDP cannot be approximated within (frac{1}{2}(frac{1}{8}-epsilon )ln |V|) for any (epsilon >0), unless (NPsubseteq DTIME(|V|^{O(log (log |V|)})). Finally, we prove that the MinLVEDP is APX-complete for bounded degree graphs and p-claw-free graphs for (pge 6).","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"60 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2024-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142415822","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

W-prize-collecting scheduling problem on parallel machines 并行机上的 W-特权收集调度问题

IF 1 4区数学

Journal of Combinatorial Optimization Pub Date : 2024-10-11 DOI: 10.1007/s10878-024-01212-z

Bo Hou, Tianjiao Guo, Suogang Gao, Guanghua Wang, Weili Wu, Wen Liu

引用次数: 0

Minimizing the maximum lateness for scheduling with release times and job rejection 最小化带释放时间和作业拒绝的调度最大延迟时间

IF 1 4区数学

Journal of Combinatorial Optimization Pub Date : 2024-10-11 DOI: 10.1007/s10878-024-01205-y

Imed Kacem, Hans Kellerer

引用次数: 0