Pages that link to "Item:Q5108249"

The following pages link to On Submodular Search and Machine Scheduling (Q5108249):

Displaying 9 items.

• Applying ``peeling onion'' approach for competitive analysis in online scheduling with rejection (Q2029304) (← links)
• Search and delivery man problems: when are depth-first paths optimal? (Q2184055) (← links)
• Search and rescue in the face of uncertain threats (Q2184077) (← links)
• Time-critical testing and search problems (Q2242292) (← links)
• A Review for Submodular Optimization on Machine Scheduling Problems (Q3297835) (← links)
• A Semi-Online Algorithm for Single Machine Scheduling with Rejection (Q5024475) (← links)
• Exact and Approximation Algorithms for the Expanding Search Problem (Q5084651) (← links)
• A General Framework for Approximating Min Sum Ordering Problems (Q5087715) (← links)
• Optimal patrolling strategies for trees and complete networks (Q6096604) (← links)