Decomposable multi-parameter matroid optimization problems. (Q1401298): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Weighted Multidimensional Search and Its Application to Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient randomized algorithms for some geometric optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time bounds for selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-constrained matroidal knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting hyperplanes for divide-and-conquer / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm for intersecting line segments in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deterministic view of random sampling and its use in geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear programming in \(O(n\times 3^{d^2})\) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2743984 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal-Time Algorithm for Slope Selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3772828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsification—a technique for speeding up dynamic graph algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separator based sparsification. I: Planarity testing and minimum spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4508378 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time algorithms for parametric minimum spanning tree problems on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Parametric Search on Graphs of Bounded Tree-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3129922 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On matroids and hierarchical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for finding a minimum spanning pseudoforest / rank
 
Normal rank
Property / cites work
 
Property / cites work: A randomized linear-time algorithm to find minimum spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster shortest-path algorithms for planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4130999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite subgraphs as matroid circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Optimization with Rational Objective Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying Parallel Computation Algorithms in the Design of Serial Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using separation algorithms in fixed dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3135082 / rank
 
Normal rank

Latest revision as of 09:49, 6 June 2024

scientific article
Language Label Description Also known as
English
Decomposable multi-parameter matroid optimization problems.
scientific article

    Statements

    Decomposable multi-parameter matroid optimization problems. (English)
    0 references
    17 August 2003
    0 references
    0 references
    prune-and-search
    0 references
    tournament-like algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references