The following pages link to (Q4232775):
Displaying 12 items.
- On approximating four covering and packing problems (Q1021577) (← links)
- Treelike comparability graphs (Q1026130) (← links)
- Improved approximation algorithms for weighted 2-path partitions (Q1706113) (← links)
- Triangle strings: structures for augmentation of vertex-disjoint triangle sets (Q2448121) (← links)
- On the complexity of colouring antiprismatic graphs (Q2659773) (← links)
- An improved kernel for planar vertex-disjoint triangle packing (Q2672577) (← links)
- Improved Approximation Algorithms for Weighted 2-Path Partitions (Q3452854) (← links)
- Triangle packing in (sparse) tournaments: approximation and kernelization (Q5111699) (← links)
- 1-Triangle graphs and perfect neighborhood sets (Q5269160) (← links)
- A randomized approximation algorithm for metric triangle packing (Q5918266) (← links)
- A deterministic approximation algorithm for metric triangle packing (Q6589849) (← links)
- An improved approximation algorithm for metric triangle packing (Q6636067) (← links)