Pages that link to "Item:Q1195856"
From MaRDI portal
The following pages link to A \((\Delta / 2)\)-approximation algorithm for the maximum independent set problem (Q1195856):
Displaying 17 items.
- A heuristic based on negative chordless cycles for the maximum balanced induced subgraph problem (Q342319) (← links)
- On the performance guarantee of neural networks for NP-hard optimization problems (Q672967) (← links)
- A natural model and a parallel algorithm for approximately solving the maximum weighted independent set problem (Q1129388) (← links)
- A generalization of König-Egervary graphs and heuristics for the maximum independent set problem with improved approximation ratios (Q1278660) (← links)
- Improved approximations for maximum independent set via approximation chains (Q1372278) (← links)
- Extracting pure network submatrices in linear programs using signed graphs. (Q1427813) (← links)
- An improved approximation for maximum \(k\)-dependent set on bipartite graphs (Q2057593) (← links)
- The maximum balanced subgraph of a signed graph: applications and solution approaches (Q2356257) (← links)
- Finding independent sets in unions of perfect graphs (Q2908854) (← links)
- Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs (Q3656864) (← links)
- Improved approximations of independent sets in bounded-degree graphs via subgraph removal (Q4698692) (← links)
- (Q4845153) (← links)
- Approximating maximum independent sets by excluding subgraphs (Q5056088) (← links)
- A (1.4 + epsilon)-Approximation Algorithm for the 2-Max-Duo Problem (Q5136287) (← links)
- Structural Information and Communication Complexity (Q5315241) (← links)
- Approximation algorithms for maximum independent set of pseudo-disks (Q5370733) (← links)
- A priori optimization for the probabilistic maximum independent set problem (Q5958320) (← links)
