Pages that link to "Item:Q3093619"
From MaRDI portal
The following pages link to Terminal Backup, 3D Matching, and Covering Cubic Graphs (Q3093619):
Displaying 11 items.
- Resource buying games (Q487012) (← links)
- Clustering with lower-bounded sizes. A general graph-theoretic framework (Q722539) (← links)
- Pattern-guided \(k\)-anonymity (Q1736590) (← links)
- L-extendable functions and a proximity scaling algorithm for minimum cost multiflow problem (Q1751126) (← links)
- Strategic cooperation in cost sharing games (Q1939521) (← links)
- Approximating the Generalized Terminal Backup Problem via Half-Integral Multiflow Relaxation (Q2804546) (← links)
- The Generalized Terminal Backup Problem (Q2947440) (← links)
- Discrete Convex Functions on Graphs and Their Algorithmic Applications (Q4689627) (← links)
- Node-Connectivity Terminal Backup, Separately Capacitated Multiflow, and Discrete Convexity (Q5883291) (← links)
- Improved approximation algorithms for minimum power covering problems (Q5919677) (← links)
- Arbitrary profit sharing in federated learning utility games (Q6546278) (← links)
