Pages that link to "Item:Q608252"
From MaRDI portal
The following pages link to A tight bound on the min-ratio edge-partitioning problem of a tree (Q608252):
Displaying 10 items.
- A note on the minimum bounded edge-partition of a tree (Q967344) (← links)
- Improved algorithms for the continuous tree edge-partition problems and a note on ratio and sorted matrices searches (Q972328) (← links)
- On a tree-cutting problem of P. Ash (Q1182874) (← links)
- A linear-time algorithm for finding an edge-partition with max-min ratio at most two (Q1949099) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- Tree edge decomposition with an application to minimum ultrametric tree approximation (Q2369981) (← links)
- On the uniform edge-partition of a tree (Q2370420) (← links)
- (Q3334089) (← links)
- A bottom‐up algorithm for weight‐ and height‐bounded minimal partition of trees (Q3339302) (← links)
- Approximate envy-freeness in graphical cake cutting (Q6611013) (← links)