A survey on graph problems parameterized above and below guaranteed values

IF 12.7 1区计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS

Computer Science Review Pub Date : 2025-08-07 DOI:10.1016/j.cosrev.2025.100795

Gregory Gutin, Matthias Mnich

{"title":"A survey on graph problems parameterized above and below guaranteed values","authors":"Gregory Gutin, Matthias Mnich","doi":"10.1016/j.cosrev.2025.100795","DOIUrl":null,"url":null,"abstract":"We survey the field of algorithms and complexity for graph problems parameterized above or below guaranteed values. Those problems seek, for a given graph <mml:math altimg=\"si1.svg\" display=\"inline\"><mml:mi>G</mml:mi></mml:math>, a solution whose value is at least <mml:math altimg=\"si2.svg\" display=\"inline\"><mml:mrow><mml:mi>g</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>G</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo linebreak=\"goodbreak\" linebreakstyle=\"after\">+</mml:mo><mml:mi>k</mml:mi></mml:mrow></mml:math> or at most <mml:math altimg=\"si3.svg\" display=\"inline\"><mml:mrow><mml:mi>g</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>G</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo linebreak=\"goodbreak\" linebreakstyle=\"after\">−</mml:mo><mml:mi>k</mml:mi></mml:mrow></mml:math>, where <mml:math altimg=\"si4.svg\" display=\"inline\"><mml:mrow><mml:mi>g</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>G</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math> is a guarantee on the value that <ce:italic>any</ce:italic> solution on <mml:math altimg=\"si1.svg\" display=\"inline\"><mml:mi>G</mml:mi></mml:math> takes. The goal is to design algorithms which find such solution in time whose complexity in <mml:math altimg=\"si6.svg\" display=\"inline\"><mml:mi>k</mml:mi></mml:math> is decoupled from that in the guarantee, or to rule out the existence of such algorithms by means of intractability results. We discuss a large number of algorithms and intractability results, and complement them by several open problems.","PeriodicalId":48633,"journal":{"name":"Computer Science Review","volume":"24 1","pages":"100795"},"PeriodicalIF":12.7000,"publicationDate":"2025-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Science Review","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1016/j.cosrev.2025.100795","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}

引用次数: 0

Abstract

We survey the field of algorithms and complexity for graph problems parameterized above or below guaranteed values. Those problems seek, for a given graph G, a solution whose value is at least g(G)+k or at most g(G)−k, where g(G) is a guarantee on the value that any solution on G takes. The goal is to design algorithms which find such solution in time whose complexity in k is decoupled from that in the guarantee, or to rule out the existence of such algorithms by means of intractability results. We discuss a large number of algorithms and intractability results, and complement them by several open problems.

查看原文本刊更多论文

关于保证值上下参数化图问题的综述

我们研究了在保证值以上或以下参数化的图问题的算法和复杂性。对于给定的图G，这些问题寻求值至少为G (G)+k或最大为G (G)−k的解，其中G (G)是G上任意解取值的保证。目标是设计算法，使其在时间内找到这样的解，且k的复杂度与保证解解解耦，或者通过结果的难解性来排除这样的算法的存在。我们讨论了大量的算法和棘手的结果，并补充了几个开放的问题。

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

求助全文

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

来源期刊

Computer Science Review Computer Science-General Computer Science

CiteScore

32.70

自引率

0.00%

发文量

审稿时长

51 days

期刊介绍： Computer Science Review, a publication dedicated to research surveys and expository overviews of open problems in computer science, targets a broad audience within the field seeking comprehensive insights into the latest developments. The journal welcomes articles from various fields as long as their content impacts the advancement of computer science. In particular, articles that review the application of well-known Computer Science methods to other areas are in scope only if these articles advance the fundamental understanding of those methods.