Decomposable multi-parameter matroid optimization problems.
type: Item
instance of: scholarly article
title: Decomposable multi-parameter matroid optimization problems.
zbMATH Open document ID: 1045.68047
DOI: 10.1016/S0304-3975(02)00638-2
published in: Theoretical Computer Science
publication date: 2003-08-17T00:00:00Z
Mathematics Subject Classification ID: 68P10
zbMATH DE Number: 1965319
zbMATH Keywords: prune-and-search
zbMATH Keywords: tournament-like algorithms
author: David Fernández-Baca
MaRDI profile type: Publication
cites work: Weighted Multidimensional Search and Its Application to Convex Optimization
cites work: Efficient randomized algorithms for some geometric optimization problems
cites work: Time bounds for selection
cites work: Multi-constrained matroidal knapsack problems
cites work: Cutting hyperplanes for divide-and-conquer
cites work: An optimal algorithm for intersecting line segments in the plane
cites work: A deterministic view of random sampling and its use in geometry
cites work: Finding Minimum Spanning Trees
cites work: Linear programming in \(O(n\times 3^{d^2})\) time
cites work: Maximizing concave functions in fixed dimension
cites work: An Optimal-Time Algorithm for Slope Selection
cites work: On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
cites work: Q3772828
cites work: Sparsification—a technique for speeding up dynamic graph algorithms
cites work: Separator based sparsification. I: Planarity testing and minimum spanning trees
cites work: Q4508378
cites work: Linear-time algorithms for parametric minimum spanning tree problems on planar graphs
cites work: Optimal Parametric Search on Graphs of Bounded Tree-Width
cites work: Q3129922
cites work: On matroids and hierarchical graphs
cites work: A linear-time algorithm for finding a minimum spanning pseudoforest
cites work: A randomized linear-time algorithm to find minimum spanning trees
cites work: Faster shortest-path algorithms for planar graphs
cites work: Q4130999
cites work: Infinite subgraphs as matroid circuits
cites work: Combinatorial Optimization with Rational Objective Functions
cites work: Applying Parallel Computation Algorithms in the Design of Serial Algorithms
cites work: Using separation algorithms in fixed dimension
cites work: Q3135082
description: scientific article; zbMATH DE number 1965319