scientific article
From MaRDI portal
Publication:2721980
zbMath0966.68609MaRDI QIDQ2721980
Publication date: 11 July 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (11)
Approximation algorithms for NMR spectral peak assignment. ⋮ Traveling salesman problems in temporal graphs ⋮ The limits of local search for weighted \(k\)-set packing ⋮ Improved Parameterized Algorithms for Weighted 3-Set Packing ⋮ Subexponential-time algorithms for maximum independent set in \(P_t\)-free and broom-free graphs ⋮ Near Approximation of Maximum Weight Matching through Efficient Weight Reduction ⋮ Clique-detection models in computational biochemistry and genomics ⋮ A randomized approximation algorithm for metric triangle packing ⋮ A local search algorithm for binary maximum 2-path partitioning ⋮ An improved approximation algorithm for the minimum common integer partition problem ⋮ Distributed algorithms for matching in hypergraphs
This page was built for publication:
