Pages that link to "Item:Q3725872"
From MaRDI portal
The following pages link to A Dynamic Programming Algorithm for Covering Problems with (Greedy) Totally Balanced Constraint Matrices (Q3725872):
Displaying 7 items.
- Towards a characterization of leaf powers by clique arrangements (Q343767) (← links)
- Characterising \((k,\ell )\)-leaf powers (Q968117) (← links)
- Totally balanced and totally unimodular matrices defined by center location problems (Q1104945) (← links)
- Improved complexity bounds for location problems on the real line (Q1180820) (← links)
- Neighborhood subtree tolerance graphs (Q1801665) (← links)
- Worst-case incremental analysis for a class ofp-facility location problems (Q4537620) (← links)
- Ptolemaic Graphs and Interval Graphs Are Leaf Powers (Q5458553) (← links)