Matchings under distance constraints. I (Q2241576): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: CALMA / rank
 
Normal rank
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/s10479-021-04127-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3177317318 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models and solution techniques for frequency assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating maximum uniquely restricted matchings in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted b-Matchings in Degree-Bounded Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3085455 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some hard and some tractable cases of the maximum acyclic matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Matching Problems for Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The distance matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Maximum Cost $K_{t,t}$‐Free <i>t</i>‐Matchings of Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strongly polynomial minimum cost circulation algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: List-coloring of interval graphs with application to register assignment for heterogeneous register-set architectures / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:51, 27 July 2024

scientific article
Language Label Description Also known as
English
Matchings under distance constraints. I
scientific article

    Statements

    Matchings under distance constraints. I (English)
    0 references
    0 references
    9 November 2021
    0 references
    0 references
    0 references
    0 references
    0 references
    distance matching
    0 references
    restricted \(b\)-matching
    0 references
    constrained matching
    0 references
    scheduling
    0 references
    parameterized algorithms
    0 references
    approximation algorithms
    0 references
    integrality gap
    0 references
    0 references