Pages that link to "Item:Q1029021"
From MaRDI portal
The following pages link to A new approach for approximating node deletion problems (Q1029021):
Displaying 19 items.
- On the complexity of making a distinguished vertex minimum or maximum degree by vertex deletion (Q491619) (← links)
- A generalization of Nemhauser and Trotter's local optimization theorem (Q657921) (← links)
- Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties (Q955347) (← links)
- A new variant of the \(A^*\)-algorithm which closes a node at most once. (Q1354068) (← links)
- Moderately exponential time algorithms for the maximum bounded-degree-1 set problem (Q1627852) (← links)
- PTAS for \(\mathcal{H}\)-free node deletion problems in disk graphs (Q1706122) (← links)
- Approximation algorithm for (connected) bounded-degree deletion problem on unit disk graphs (Q2193275) (← links)
- Approximation algorithm for minimum weight connected-\(k\)-subgraph cover (Q2197543) (← links)
- Computational complexity of minimum \(P_4\) vertex cover problem for regular and \(K_{1, 4}\)-free graphs (Q2341756) (← links)
- Optimal MST Maintenance for Transient Deletion of Every Node in Planar Graphs (Q3082947) (← links)
- A unified local ratio approximation of node-deletion problems (Q4595485) (← links)
- (Q5075776) (← links)
- Approximating Partially Bounded Degree Deletion on Directed Graphs (Q5240368) (← links)
- Approximating Bounded Degree Deletion via Matroid Matching (Q5283370) (← links)
- Node-and edge-deletion NP-complete problems (Q5402565) (← links)
- Combining the Delete Relaxation with Critical-Path Heuristics: A Direct Characterization (Q5739833) (← links)
- Approximating power node-deletion problems (Q6057334) (← links)
- Approximating power node-deletion problems (Q6593676) (← links)
- Efficient constant-factor approximate enumeration of minimal subsets for monotone properties with weight constraints (Q6657233) (← links)
