The following pages link to (Q5116470):
Displaying 18 items.
- Multistage graph problems on a global budget (Q831134) (← links)
- Sliding window temporal graph coloring (Q2037193) (← links)
- Online multistage subset maximization problems (Q2041973) (← links)
- A faster parameterized algorithm for temporal matching (Q2059876) (← links)
- A simple rounding scheme for multistage optimization (Q2077374) (← links)
- Target-based computer-assisted orchestration: complexity and approximation algorithms (Q2079398) (← links)
- LP-based algorithms for multistage minimization problems (Q2117680) (← links)
- Multistage knapsack (Q2119404) (← links)
- Multistage vertex cover (Q2135630) (← links)
- Temporal matching (Q2285132) (← links)
- On Lagrangian relaxation for constrained maximization and reoptimization problems (Q2664005) (← links)
- A multistage view on 2-satisfiability (Q2692727) (← links)
- (Q5092381) (← links)
- Approximating multistage matching problems (Q5918627) (← links)
- Approximating multistage matching problems (Q5918760) (← links)
- Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs (Q6087215) (← links)
- Multistage \(s-t\) path: confronting similarity with dissimilarity (Q6107891) (← links)
- Computing maximum matchings in temporal graphs (Q6168321) (← links)
