Pages that link to "Item:Q4074668"
From MaRDI portal
The following pages link to Vertex packings: Structural properties and algorithms (Q4074668):
Displaying 50 items.
- Vertex cover meets scheduling (Q270025) (← links)
- Kernelization of the 3-path vertex cover problem (Q279214) (← links)
- Distributionally robust mixed integer linear programs: persistency models with applications (Q296964) (← links)
- On a generalization of Nemhauser and Trotter's local optimization theorem (Q340561) (← links)
- Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter (Q372970) (← links)
- Approximability of the vertex cover problem in power-law graphs (Q385960) (← links)
- Solving min ones 2-SAT as fast as vertex cover (Q393120) (← links)
- Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms (Q411835) (← links)
- Generalized roof duality and bisubmodular functions (Q412330) (← links)
- Local maximum stable set greedoids stemming from very well-covered graphs (Q444454) (← links)
- How tight is the corner relaxation? Insights gained from the stable set problem (Q448970) (← links)
- The Hirsch conjecture for the fractional stable set polytope (Q463733) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Combinatorics for smaller kernels: the differential of a graph (Q476877) (← links)
- A branch and cut solver for the maximum stable set problem (Q491210) (← links)
- Crowns in bipartite graphs (Q510531) (← links)
- A kernel of order \(2k - c\) for Vertex Cover (Q534063) (← links)
- Hooked on IP (Q537605) (← links)
- Minimum vertex cover in rectangle graphs (Q551504) (← links)
- On approximating minimum vertex cover for graphs with perfect matching (Q557830) (← links)
- Quadratic kernelization for convex recoloring of trees (Q639283) (← links)
- A generalization of Nemhauser and Trotter's local optimization theorem (Q657921) (← links)
- On local maximum stable set greedoids (Q658102) (← links)
- Computing solutions for matching games (Q662281) (← links)
- Iterative improvement of vertex covers (Q672405) (← links)
- Randomized approximation of bounded multicovering problems (Q679446) (← links)
- Greed is good: Approximating independent sets in sparse and bounded-degree graphs (Q679458) (← links)
- Pseudo-Boolean optimization (Q697569) (← links)
- Improved upper bounds for vertex cover (Q708228) (← links)
- Approximability of clique transversal in perfect graphs (Q724231) (← links)
- The complexity ecology of parameters: An illustration using bounded max leaf number (Q733736) (← links)
- On approximation problems related to the independent set and vertex cover problems (Q760210) (← links)
- Ramsey numbers and an approximation algorithm for the vertex cover problem (Q762496) (← links)
- Approximating edge dominating set in dense graphs (Q764308) (← links)
- Strong and weak edges of a graph and linkages with the vertex cover problem (Q765356) (← links)
- On certain classes of fractional matchings (Q798265) (← links)
- Finding maximum cliques in arbitrary and in special graphs (Q807639) (← links)
- On miniaturized problems in parameterized complexity theory (Q820145) (← links)
- Parameterized enumeration, transversals, and imperfect phylogeny reconstruction (Q820146) (← links)
- Compactors for parameterized counting problems (Q826317) (← links)
- An edge-reduction algorithm for the vertex cover problem (Q833573) (← links)
- Strong computational lower bounds via parameterized complexity (Q856413) (← links)
- Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906) (← links)
- Minimum 2SAT-DELETION: Inapproximability results and relations to minimum vertex cover (Q867859) (← links)
- Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover (Q897878) (← links)
- A network approach for specially structured linear programs arising in 0-1 quadratic optimization (Q943852) (← links)
- A cubic kernel for feedback vertex set and loop cutset (Q968273) (← links)
- Graph operations that are good for greedoids (Q987691) (← links)
- A note on the greedy algorithm for finding independent sets of \(C_k\)-free graphs (Q987802) (← links)
- A kernelization algorithm for \(d\)-hitting set (Q988567) (← links)
