On Applications of Partial Scenario Set Cover: The Graph-Theoretic View

Shai Dimant () and Sven O. Krumke ()
Additional contact information
Shai Dimant: RPTU Kaiserslautern-Landau
Sven O. Krumke: RPTU Kaiserslautern-Landau

A chapter in Operations Research Proceedings 2024, 2025, pp 199-204 from Springer

Abstract: Abstract The Steiner Tree Problem is a classical network design problem. Given a graph $$G=(V,E)$$ G = ( V , E ) , a cost function $$c:E\rightarrow \mathbb {R}_{\ge 0}$$ c : E → R ≥ 0 and a subset $$R\subseteq V$$ R ⊆ V of vertices, the goal is to find a minimum cost subtree of G containing all terminal nodes, i.e. all nodes from R. We study Partial Scenario Steiner Tree (PSST) where the terminal set R is uncertain: One is given a collection $$\mathcal {U} = \{\xi _1,\ldots ,\xi _k\}\subseteq 2^V$$ U = { ξ 1 , … , ξ k } ⊆ 2 V of (terminal set) scenarios and the goal is to find a minimum cost subtree of G which completely contains at least a prespecified number l of the scenarios from $$\mathcal {U}$$ U . PSST is a special case of Partial Scenario Set Cover (PSSC) which generalizes the Partial Set Cover Problem, which is itself a generalization of the classical Set Cover Problem. In PSSC we are given a finite ground set Q, a collection $$\mathcal {S}$$ S of subsets of Q to choose from, each of which is associated with a nonnegative cost, and a second collection $$\mathcal {U}$$ U of subsets of Q of which a given number l must be covered. The task is to choose a minimum cost sub-collection from $$\mathcal {S}$$ S that covers at least l sets from $$\mathcal {U}$$ U . Although we focus on PSST, we also consider several other graph-theoretic cases of PSSC. These problems are as hard to approximate as the Smallest k-Edge Subgraph problem. We present simple approximation algorithms which exploit the graph theoretic nature of these problems. Our findings not only shed light on the inherent difficulty of these problems but also provide practical solutions for their approximation.

Keywords: Graph Theory; Approximation Algorithms; Complexity (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:lnopch:978-3-031-92575-7_28

Ordering information: This item can be ordered from
http://www.springer.com/9783031925757

DOI: 10.1007/978-3-031-92575-7_28

Access Statistics for this chapter

More chapters in Lecture Notes in Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().