Pages that link to "Item:Q1056763"
From MaRDI portal
The following pages link to Efficient bounds for the stable set, vertex cover and set packing problems (Q1056763):
Displaying 15 items.
- Improved approximations of independent sets in bounded-degree graphs (Q5054761) (← links)
- On approximation properties of the Independent set problem for degree 3 graphs (Q5057456) (← links)
- (Q5075740) (← links)
- The multi‐integer set cover and the facility terminal cover problem (Q5191129) (← links)
- The k-Observer Problem on d-regular Graphs (Q5207902) (← links)
- Universal hinge patterns for folding strips efficiently into any grid polyhedron (Q5918984) (← links)
- Algorithm for optimal winner determination in combinatorial auctions (Q5958538) (← links)
- A probabilistic algorithm for vertex cover (Q6144024) (← links)
- Constant ratio approximations of the weighted feedback vertex set problem for undirected graphs (Q6487955) (← links)
- Greedy approximations of independent sets in low degree graphs (Q6487957) (← links)
- Independent set in \(k\)-claw-free graphs: conditional \(\chi \)-boundedness and the power of LP/SDP relaxations (Q6574949) (← links)
- Approximation algorithms for covering vertices by long paths (Q6586665) (← links)
- An approximation algorithm for covering vertices by \(4^+\)-paths (Q6606209) (← links)
- Ultimate greedy approximation of independent sets in subcubic graphs (Q6623597) (← links)
- Hardness and approximation of submodular minimum linear ordering problems (Q6634527) (← links)