A local search algorithm for binary maximum 2-path partitioning (Q1799391): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disopt.2013.09.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2045526752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximations for maximum transportation with permutable supply vector and other capacitated star packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for maximum triangle packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplying Pessimistic Estimators: Deterministic Approximation of Max TSP and Maximum Triangle Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved randomized approximation algorithm for maximum triangle packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for maximum packing of 3-edge paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation results for the weighted \(P_4\) partition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the test cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: How many disjoint 2-edge paths must a cubic graph have? / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for maximum \(P_{3}\)-packing in subcubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The path partition problem and related problems in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Size of Systems of Sets Every <i>t</i> of which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4886045 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Local Search for Weighted <i>k</i>-Set Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonoverlapping local alignments (weighted independent sets of axis-parallel rectangles) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252286 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2721980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-Complete Approximation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(k\)-path partition of graphs. / rank
 
Normal rank

Latest revision as of 23:11, 16 July 2024

scientific article
Language Label Description Also known as
English
A local search algorithm for binary maximum 2-path partitioning
scientific article

    Statements

    A local search algorithm for binary maximum 2-path partitioning (English)
    0 references
    0 references
    0 references
    18 October 2018
    0 references
    analysis of algorithms
    0 references
    maximum path partitioning
    0 references
    2-edge paths
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references