Pages that link to "Item:Q5248497"
From MaRDI portal
The following pages link to On the hardness of approximating minimization problems (Q5248497):
Displaying 7 items.
- Simple heuristics for unit disk graphs (Q4698229) (← links)
- Probabilistic proof systems — A survey (Q5048957) (← links)
- On the hardness of approximating the minimum consistent OBDD problem (Q5054808) (← links)
- Parallel and sequential approximation of shortest superstrings (Q5056169) (← links)
- Vertex Deletion Problems on Chordal Graphs (Q5136314) (← links)
- On the primer selection problem in polymerase chain reaction experiments (Q5961627) (← links)
- $st$-Orientations with Few Transitive Edges (Q6141787) (← links)