Pages that link to "Item:Q489711"
From MaRDI portal
The following pages link to Approximability of the subset sum reconfiguration problem (Q489711):
Displaying 9 items.
- Linear-time algorithm for sliding tokens on trees (Q496016) (← links)
- On reconfigurability of target sets (Q2110378) (← links)
- Reconfiguration of list \(L(2,1)\)-labelings in a graph (Q2250462) (← links)
- Using contracted solution graphs for solving reconfiguration problems (Q2329308) (← links)
- Introduction to reconfiguration (Q2331456) (← links)
- Independent Set Reconfiguration in Cographs and their Generalizations (Q2825488) (← links)
- A Reconfigurations Analogue of Brooks' Theorem and Its Consequences (Q2833252) (← links)
- Reconfiguration of satisfying assignments and subset sums: easy to find, hard to connect (Q5916254) (← links)
- Reconfiguration of multisets with applications to bin packing (Q6575396) (← links)
