Euclidean maximum matchings in the plane -- local to global (Q832859): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an 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.1007/978-3-030-83508-8_14 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3190359733 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4327375 / 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: A survey of heuristics for the weighted matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum plane trees in multipartite geometric graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3029701 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Approximation for Maximum Weight Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Long non-crossing configurations in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning heuristics for two geometric maximization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138921 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data Structures for Weighted Matching and Extensions to <i>b</i> -matching and <i>f</i> -factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $O(EV\log V)$ Algorithm for Finding a Maximal Weighted Matching in General Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Maximum Cut of a Planar Graph in Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stabbing pairwise intersecting disks by five points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching points with disks with a common intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519711 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular Maximization over Multiple Matroids via Generalized Exchange Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicommodity flows in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Euclidean assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3738164 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for edge-disjoint paths in planar graphs / rank
 
Normal rank

Latest revision as of 11:05, 28 July 2024

scientific article
Language Label Description Also known as
English
Euclidean maximum matchings in the plane -- local to global
scientific article

    Statements

    Euclidean maximum matchings in the plane -- local to global (English)
    0 references
    0 references
    0 references
    0 references
    25 March 2022
    0 references
    planar points
    0 references
    maximum matching
    0 references
    global maximum
    0 references
    local maximum
    0 references
    pairwise crossing matching
    0 references
    pairwise intersecting disks
    0 references

    Identifiers