Decomposable multi-parameter matroid optimization problems.
From MaRDI portal
Publication:1401298
DOI10.1016/S0304-3975(02)00638-2zbMath1045.68047MaRDI QIDQ1401298
Publication date: 17 August 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A deterministic view of random sampling and its use in geometry
- A linear-time algorithm for finding a minimum spanning pseudoforest
- Infinite subgraphs as matroid circuits
- On matroids and hierarchical graphs
- Cutting hyperplanes for divide-and-conquer
- Linear-time algorithms for parametric minimum spanning tree problems on planar graphs
- Time bounds for selection
- Efficient randomized algorithms for some geometric optimization problems
- Multi-constrained matroidal knapsack problems
- Separator based sparsification. I: Planarity testing and minimum spanning trees
- Linear programming in \(O(n\times 3^{d^2})\) time
- Optimal Parametric Search on Graphs of Bounded Tree-Width
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- An Optimal-Time Algorithm for Slope Selection
- Combinatorial Optimization with Rational Objective Functions
- Using separation algorithms in fixed dimension
- Finding Minimum Spanning Trees
- An optimal algorithm for intersecting line segments in the plane
- A randomized linear-time algorithm to find minimum spanning trees
- Sparsification—a technique for speeding up dynamic graph algorithms
- On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
- Weighted Multidimensional Search and Its Application to Convex Optimization
- Faster shortest-path algorithms for planar graphs
This page was built for publication: Decomposable multi-parameter matroid optimization problems.
