The following pages link to (Q3113716):
Displaying 11 items.
- Linear-vertex kernel for the problem of packing \(r\)-stars into a graph without long induced paths (Q264204) (← links)
- Constant factor approximation for the weighted partial degree bounded edge packing problem (Q1631679) (← links)
- Improved approximation algorithms for weighted 2-path partitions (Q1706113) (← links)
- The superstar packing problem (Q2149487) (← links)
- Quantifying hierarchical conflicts in homology statements (Q2163958) (← links)
- Constant Factor Approximation for the Weighted Partial Degree Bounded Edge Packing Problem (Q2958313) (← links)
- Improved Approximation Algorithms for Weighted 2-Path Partitions (Q3452854) (← links)
- A generic framework for approximation analysis of greedy algorithms for star bicoloring (Q5085266) (← links)
- Approximation algorithms for the maximum-weight cycle/path packing problems (Q6542868) (← links)
- The maximum 3-star packing problem in claw-free cubic graphs (Q6645157) (← links)
- Packing 2- and 3-stars into \(( 2 , 3 )\)-regular graphs (Q6657246) (← links)
