Pages that link to "Item:Q4630248"

The following pages link to Polynomially bounded minimization problems which are hard to approximate (Q4630248):

Displaying 6 items.

• Approximate solution of NP optimization problems (Q672315) (← links)
• The complexity and approximability of finding maximum feasible subsystems of linear relations (Q1367542) (← links)
• Exploring the Kernelization Borders for Hitting Cycles (Q5009476) (← links)
• Intractability of assembly sequencing: Unit disks in the plane (Q5096948) (← links)
• Parameterized complexity of conflict-free set cover (Q5918356) (← links)
• Conflict free version of covering problems on graphs: classical and parameterized (Q5918906) (← links)