Pages that link to "Item:Q293227"
From MaRDI portal
The following pages link to An improved fixed-parameter algorithm for vertex cover (Q293227):
Displayed 15 items.
- An efficient fixed-parameter algorithm for 3-hitting set (Q876698) (← links)
- Enumerate and expand: Improved algorithms for connected vertex cover and tree cover (Q929296) (← links)
- A general method to speed up fixed-parameter-tractable algorithms (Q1607033) (← links)
- Solving large FPT problems on coarse-grained parallel machines (Q1877701) (← links)
- On the existence of subexponential parameterized algorithms (Q1877709) (← links)
- Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms (Q1877711) (← links)
- Improved exact algorithms for MAX-SAT (Q1878397) (← links)
- The complexity of irredundant sets parameterized by size (Q1971218) (← links)
- A note on the complexity of minimum dominating set (Q2458924) (← links)
- Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover (Q2576350) (← links)
- Parameterized computation and complexity: a new approach dealing with NP-hardness (Q2576825) (← links)
- Efficient Algorithms for Fixed-Precision Instances of Bin Packing and Euclidean TSP (Q3541790) (← links)
- (Q4506265) (← links)
- A HYBRID HEURISTIC FOR THE MINIMUM WEIGHT VERTEX COVER PROBLEM (Q5483436) (← links)
- A fixed-parameter-tractable algorithm for set packing (Q5957983) (← links)