Improved deterministic algorithms for weighted matching and packing problems (Q534565): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2010.10.042 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2107174677 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using nondeterminism to design efficient deterministic algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized Divide-and-Conquer: Improved Path, Matching, and Packing Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster fixed-parameter tractable algorithms for matching and packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Storing a Sparse Table with <i>0</i> (1) Worst Case Access Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient parameterized algorithm for m-set packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster parameterized algorithm for set packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Algebraic Algorithms for Path and Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy Localization and Color-Coding: Improved Matching and Packing Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4231923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Parameterized Algorithms for Weighted 3-Set Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O *(3.523k ) Parameterized Algorithm for 3-Set Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding paths of length \(k\) in \(O^{*}(2^k)\) time / rank
 
Normal rank

Latest revision as of 01:15, 4 July 2024

scientific article
Language Label Description Also known as
English
Improved deterministic algorithms for weighted matching and packing problems
scientific article

    Statements

    Improved deterministic algorithms for weighted matching and packing problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    18 May 2011
    0 references
    \(r\)D-matching
    0 references
    \(r\)-set packing
    0 references
    randomized divide-and-conquer
    0 references
    (\(n,k\))-universal set
    0 references

    Identifiers