A note on the set union knapsack problem

DOI10.1016/j.dam.2013.12.015zbMath1288.05177OpenAlexW2021083959MaRDI QIDQ2449074

Ashwin Arulselvan

Publication date: 6 May 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2013.12.015

zbMATH Keywords

approximationgreedydensest \(k\)-subgraphset-union knapsack

Mathematics Subject Classification ID

Integer programming (90C10) Approximation algorithms (68W25) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Density (toughness, etc.) (05C42)

Related Items (1)

The incremental connected facility location problem

Cites Work

• Unnamed Item
• The budgeted maximum coverage problem
• Graph expansion and the unique games conjecture
• The dense \(k\)-subgraph problem

This page was built for publication: A note on the set union knapsack problem