Pages that link to "Item:Q5716851"
From MaRDI portal
The following pages link to Automata, Languages and Programming (Q5716851):
Displayed 18 items.
- Minimum vertex cover in rectangle graphs (Q551504) (← links)
- Local search with edge weighting and configuration checking heuristics for minimum vertex cover (Q646517) (← links)
- An edge-reduction algorithm for the vertex cover problem (Q833573) (← links)
- Minimum 2SAT-DELETION: Inapproximability results and relations to minimum vertex cover (Q867859) (← links)
- On short paths interdiction problems: Total and node-wise limited interdiction (Q929289) (← links)
- The 0-1 inverse maximum stable set problem (Q955316) (← links)
- A better list heuristic for vertex cover (Q963417) (← links)
- On inverse traveling salesman problems (Q1936660) (← links)
- An approximation algorithm dependent on edge-coloring number for minimum maximal matching problem (Q1944924) (← links)
- Minimum vertex cover in ball graphs through local search (Q2250102) (← links)
- A primal-dual approximation algorithm for partial vertex cover: Making educated guesses (Q2391176) (← links)
- Flip distance between triangulations of a planar point set is APX-hard (Q2444311) (← links)
- Vertex cover might be hard to approximate to within \(2 - \varepsilon \) (Q2475406) (← links)
- The Uniform Minimum-Ones 2SAT Problem and its Application to Haplotype Classification (Q3060204) (← links)
- Nearly Optimal NP-Hardness of Vertex Cover on k-Uniform k-Partite Hypergraphs (Q3088105) (← links)
- Linear time algorithms for approximating the facility terminal cover problem (Q3593378) (← links)
- The multi‐integer set cover and the facility terminal cover problem (Q5191129) (← links)
- Graph covering using bounded size subgraphs (Q6132557) (← links)