Improved approximation algorithms for weighted 2-path partitions
type: Item
instance of: scholarly article
title: Improved approximation algorithms for weighted 2-path partitions
zbMATH Open document ID: 1382.05056
author: Amotz Bar-Noy
author: David Peleg
author: George Rabanca
author: Ivo Vigan
published in: Discrete Applied Mathematics
publication date: 2018-03-21T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 6851655
zbMATH Keywords: graph partitioning
zbMATH Keywords: graph packing
zbMATH Keywords: graph factor
zbMATH Keywords: approximation algorithms
MaRDI profile type: Publication
full work available at URL: j.dam.2017.11.031
OpenAlex ID: W2788624646
cites work: On local search for weighted \(k\)-set packing
cites work: Q3113716
cites work: An improved randomized approximation algorithm for maximum triangle packing
cites work: Erratum to: ``An improved randomized approximation algorithm for maximum triangle packing''
cites work: Q4437505
cites work: The monadic second-order logic of graphs. XIV: Uniformly sparse graphs and edge set quantifica\-tions.
cites work: Q4198056
cites work: Q4232775
cites work: Q4886045
cites work: An approximation algorithm for maximum packing of 3-edge paths
cites work: An approximation algorithm for maximum triangle packing
cites work: Erratum to ``An approximation algorithm for maximum triangle packing''
cites work: A local search algorithm for binary maximum 2-path partitioning
cites work: Packings by Complete Bipartite Graphs
cites work: On the Size of Systems of Sets Every t of which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems
cites work: Maximum bounded 3-dimensional matching is MAX SNP-complete
cites work: On the complexity of some edge-partition problems for graphs
cites work: Packing triangles in low degree graphs and indifference graphs
cites work: Looking at the stars
cites work: Star Partitions of Perfect Graphs
cites work: Multiplying Pessimistic Estimators: Deterministic Approximation of Max TSP and Maximum Triangle Packing
DOI: 10.1016/J.DAM.2017.11.031
description: scientific article; zbMATH DE number 6851655