A local search algorithm for binary maximum 2-path partitioning
From MaRDI portal
Publication:1799391
DOI10.1016/j.disopt.2013.09.001zbMath1506.05171OpenAlexW2045526752MaRDI QIDQ1799391
Publication date: 18 October 2018
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2013.09.001
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (2)
Improved Approximation Algorithms for Weighted 2-Path Partitions ⋮ Improved approximation algorithms for weighted 2-path partitions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An approximation algorithm for maximum packing of 3-edge paths
- An approximation algorithm for maximum \(P_{3}\)-packing in subcubic graphs
- Approximation results for the weighted \(P_4\) partition problem
- An improved randomized approximation algorithm for maximum triangle packing
- On the \(k\)-path partition of graphs.
- Approximation algorithms for the test cover problem
- Approximations for maximum transportation with permutable supply vector and other capacitated star packing problems
- The path partition problem and related problems in bipartite graphs
- An approximation algorithm for maximum triangle packing
- On Local Search for Weighted k-Set Packing
- 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
- Multiplying Pessimistic Estimators: Deterministic Approximation of Max TSP and Maximum Triangle Packing
- A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem
- P-Complete Approximation Problems
- How many disjoint 2-edge paths must a cubic graph have?
- Nonoverlapping local alignments (weighted independent sets of axis-parallel rectangles)
This page was built for publication: A local search algorithm for binary maximum 2-path partitioning
