Pages that link to "Item:Q866547"
From MaRDI portal
The following pages link to Exact algorithms and applications for tree-like Weighted Set Cover (Q866547):
Displaying 12 items.
- The complexity of weighted counting for acyclic conjunctive queries (Q395018) (← links)
- Computing cooperative solution concepts in coalitional skill games (Q490424) (← links)
- Static and dynamic source locations in undirected networks (Q889101) (← links)
- Parameterized algorithms for weighted matching and packing problems (Q955335) (← links)
- Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion (Q2039245) (← links)
- Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs (Q2462149) (← links)
- Tree decompositions of graphs: saving memory in dynamic programming (Q2465936) (← links)
- A dynamic programming algorithm for tree-like weighted set packing problem (Q2638196) (← links)
- Preferences Single-Peaked on a Tree: Multiwinner Elections and Structural Results (Q5026258) (← links)
- On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT (Q5890956) (← links)
- On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT (Q5892359) (← links)
- Parameterized complexity of multicut in weighted trees (Q6050131) (← links)
