Publication:4437505
From MaRDI portal
zbMath1032.68082MaRDI QIDQ4437505
Miroslav Chlebík, Janka Chlebíková
Publication date: 2 December 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2653/26530152.htm
90C27: Combinatorial optimization
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Unnamed Item, A randomized approximation algorithm for metric triangle packing, The Steiner tree problem on graphs: inapproximability results, An improved randomized approximation algorithm for maximum triangle packing, Improved approximation algorithms for weighted 2-path partitions, The complexity of comparing multiply-labelled trees by extending phylogenetic-tree metrics, Weighted amplifiers and inapproximability results for travelling salesman problem, Complexity of approximating bounded variants of optimization problems, Approximation hardness of edge dominating set problems, Deterministic approximation algorithms for the maximum traveling salesman and maximum triangle packing problems, Triangle strings: structures for augmentation of vertex-disjoint triangle sets, An approximation algorithm for maximum triangle packing, Improved Approximation Algorithms for Weighted 2-Path Partitions, A Problem Kernelization for Graph Packing
