Pages that link to "Item:Q5323050"
From MaRDI portal
The following pages link to Relationship between Approximability and Request Structures in the Minimum Certificate Dispersal Problem (Q5323050):
Displaying 5 items.
- Approximability and inapproximability of the minimum certificate dispersal problem (Q982648) (← links)
- Approximability of minimum certificate dispersal with tree structures (Q2354400) (← links)
- Efficient Algorithms for Alternating Pushdown Systems with an Application to the Computation of Certificate Chains (Q3522906) (← links)
- Parameterized certificate dispersal and its variants (Q5964075) (← links)
- On mixed connectivity certificates (Q6102287) (← links)