Optimal search with positive switch cost is NP-hard

DOI10.1016/0020-0190(85)90108-5zbMATH Open0577.90041OpenAlexW2084476663MaRDI QIDQ1065706FDOQ1065706

Authors: Ingo Wegener 

Publication date: 1985

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(85)90108-5

Recommendations

• The discrete search problem and the construction of optimal allocations
• AN EXACTLY OPTIMAL STRATEGY FOR A SEARCH PROBLEM WITH TRAVELING COST
• Switching strategies to optimize search
• An elementary approach to optimal discrete-time search strategies
• Search problem with two levels of examination costs

zbMATH Keywords

NP-hardnessoptimal strategyoptimal searchpositive switch cost

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Search theory (90B40)

Cites Work

• The Euclidean traveling salesman problem is NP-complete
• Title not available (Why is that?)
• Discrete Dynamic Programming
• Optimal Search Strategies
• Title not available (Why is that?)
• Optimal Search for Detecting a Hidden Object
• Discrete Sequential Search with Positive Switch Cost

Cited In (4)

• Optimal discrete search with imperfect specificity
• A search problem on a bipartite network
• Online failure diagnosis in interdependent networks
• Complexity of searching an immobile hider in a graph

This page was built for publication: Optimal search with positive switch cost is NP-hard

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1065706)