arrow
返回

Algorithmic expedients for the S-labeling problem

delete2019-08-01
delete3
delete
OA
AI
M
Markus Sinnl *
DOI:10.1016/j.cor.2019.04.014delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
Graph labeling problems have been widely studied in the last decades and have a vast area of application. In this work, we study the recently introduced S-labeling problem, in which the nodes get labeled using labels from 1 to vertical bar V vertical bar and for each edge the contribution to the objective function, called S-labeling number of the graph, is the minimum label of its end-nodes. The goal is to find a labeling with minimum value. The problem is NP-hard for planar subcubic graphs, although for many other graph classes the complexity status is still unknown. In this paper, we present different algorithmic approaches for tackling this problem: We develop an exact solution framework based on Mixed-Integer Programming (MIP) which is enhanced with valid inequalities, starting and primal heuristics and specialized branching rules. We show that our MIP formulation has no integrality gap for paths, cycles and perfect n-ary trees, and, to the best of our knowledge, we give the first polynomial-time algorithm for the problem on n-ary trees as well as a closed formula for the 5-labeling number for such trees. Moreover, we also present a Lagrangian heuristic and a constraint programming approach. A computational study is carried out in order to (i) investigate if there may be other special graph classes, where our MIP formulation has no integrality gap, and (ii) assess the effectiveness of the proposed solution approaches for solving the problem on a dataset consisting of general graphs. (C) 2019 Elsevier Ltd. All rights reserved.
Keyword:
Graph labeling
Branch-and-cut
Lagrangian relaxation
Constraint programming
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

C
Computers and Operations Research
IF:
4.3
论文数:
6.5K
被引数:
1.8W

机构

U
University of Vienna
学者数:
1.7W
论文数: 1.6W
被引数: 40
引用论文

引用论文

The Bird's Head Seascape Marine Protected Area network—Preventing biodiversity and ecosystem service loss amidst rapid change in Papua, Indonesia
err2021-03-23
err0
PREAI
errPurwanto; Dominic A. Andradi‐Brown; Dariani Matualage; Irman Rumengan; Awaludinnoer; Defy Pada; Nur I. Hidayat; Amkieltiela; Helen E. Fox; Matt Fox; Sangeeta Mangubhai; La Hamid; Muhammad E. Lazuardi; Ronald Mambrasar; Nugraha Maulana; Mulyadi; Syafri Tuharea; Fitryanti Pakiding; Gabby N. Ahmadia
err分享
err收藏
err分享
err收藏
A survey of graph layout problems
err2002-09-01
err400
PREAI
errDíaz, J; Petit, J; Serna, M
err分享
err收藏
U.S. Test System with High Spatial and Temporal Resolution for Renewable Integration Studies
err2020-08-02
err0
PREAI
errYixing Xu; Nathan Myhrvold; Dhileep Sivam; Kaspar Mueller; Daniel J. Olsen; Bainan Xia; Daniel Livengood; Victoria Hunt; Benjamin Rouille d'Orfeuil; Daniel Muldrew; Merrielle Ondreicka; Megan Bettilyon
err分享
err收藏
Tabu search for the cyclic bandwidth problem
err2015-05-01
err10
errOAAI
errRodriguez-Tello, Eduardo; Romero-Monsivais, Hillel; Ramirez-Torres, Gabriel; Lardeux, Frederic
err分享
err收藏
PSD-95 Is Essential for Hallucinogen and Atypical Antipsychotic Drug Actions at Serotonin Receptors
err2009-06-03
err0
errOAAI
errAtheir I. Abbas; Prem N. Yadav; Wei-Dong Yao; Margaret I. Arbuckle; Seth G. N. Grant; Marc G. Caron; Bryan L. Roth
err分享
err收藏
学者 查看更多内容