Approximation algorithms for Node-weighted Steiner Problems: Digraphs with Additive Prizes and Graphs with Submodular Prizes.
Gianlorenzo D'AngeloEsmaeil DelfarazPublished in: CoRR (2022)
Keyphrases
- approximation algorithms
- undirected graph
- vertex cover
- directed graph
- np hardness
- special case
- approximation schemes
- np hard
- randomized algorithms
- worst case
- network design problem
- exact algorithms
- minimum cost
- facility location problem
- set cover
- graph structure
- optimization problems
- combinatorial auctions
- weighted sum
- energy minimization
- constant factor
- combinatorial optimization
- np complete
- open shop