Pages that link to "Item:Q2701740"

The following pages link to Algorithmics for hard problems. Introduction to combinatorial optimization, randomization, approximation, and heuristics (Q2701740):

Displaying 7 items.

• On the approximability and hardness of minimum topic connected overlay and its special instances (Q418776) (← links)
• The unbiased black-box complexity of partition is polynomial (Q460634) (← links)
• Unrelated parallel machine scheduling -- perspectives and progress (Q505093) (← links)
• On the approximability of the single allocation \(p\)-hub center problem with parameterized triangle inequality (Q2149101) (← links)
• A new algorithm design technique for hard problems (Q2173301) (← links)
• Reoptimization of minimum latency problem revisited: don't panic when asked to revisit the route after local modifications (Q2420657) (← links)
• Monitoring the edges of a graph using distances (Q5896103) (← links)