\(k\)-edge subgraph problems
type: Item
instance of: scholarly article
title: \(k\)-edge subgraph problems
zbMATH Open document ID: 0870.68111
DOI: 10.1016/S0166-218X(96)00030-3
author: Olivier Goldschmidt
author: Dorit S. Hochbaum
published in: Discrete Applied Mathematics
publication date: 1997-09-07T00:00:00Z
full work available at URL: dam
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 1018591
zbMATH Keywords: \(k\)-edge-incident subgraph problem
MaRDI profile type: Publication
cites work: Q4234074
cites work: An \(O(\log k)\) approximation algorithm for the \(k\) minimum spanning tree problem in the plane
cites work: Some simplified NP-complete graph problems
cites work: Q3815886
cites work: The dense \(k\)-subgraph problem
cites work: Q4037432
cites work: Q3128917
cites work: Node-and edge-deletion NP-complete problems
Recommended article: On the \(k\)-edge-incident subgraph problem and its variants
Recommended article: The dense \(k\)-subgraph problem
Recommended article: Minimum cost \(\leq k\) edges connected subgraph problems
Recommended article: \(k\)-subdomination in graphs
Recommended article: The parameterized complexity of \(k\)-edge induced subgraphs
Recommended article: The Parameterized Complexity of k-Edge Induced Subgraphs
Recommended article: The \(k\)-node connected subgraph problem: polyhedral analysis and branch-and-cut
Recommended article: Algorithmic aspects of total k-subdomination in graphs
Recommended article: The \(k\)-regular induced subgraph problem
Recommended article: A branch-and-cut algorithm for the k-edge connected subgraph problem
description: scientific article; zbMATH DE number 1018591