The following pages link to (Q4437505):
Displayed 15 items.
- The Steiner tree problem on graphs: inapproximability results (Q952442) (← links)
- An improved randomized approximation algorithm for maximum triangle packing (Q1028142) (← links)
- Improved approximation algorithms for weighted 2-path partitions (Q1706113) (← links)
- The complexity of comparing multiply-labelled trees by extending phylogenetic-tree metrics (Q1713404) (← links)
- Weighted amplifiers and inapproximability results for travelling salesman problem (Q2156301) (← links)
- Complexity of approximating bounded variants of optimization problems (Q2368970) (← links)
- Approximation hardness of edge dominating set problems (Q2369972) (← links)
- Deterministic approximation algorithms for the maximum traveling salesman and maximum triangle packing problems (Q2446858) (← links)
- Triangle strings: structures for augmentation of vertex-disjoint triangle sets (Q2448121) (← links)
- An approximation algorithm for maximum triangle packing (Q2492197) (← links)
- Improved Approximation Algorithms for Weighted 2-Path Partitions (Q3452854) (← links)
- A Problem Kernelization for Graph Packing (Q3599088) (← links)
- (Q5875468) (← links)
- A randomized approximation algorithm for metric triangle packing (Q5918266) (← links)
- On the complexity of the cable-trench problem (Q6048437) (← links)