Random pseudo-polynomial algorithms for exact matroid problems
From MaRDI portal
Recommendations
Cited in
(47)- Exact arborescences, matchings and cycles
- Polymatroids: Construction and random algorithms
- The image of weighted combinatorial problems
- Random pseudo-polynomial algorithms for some combinatorial programming problems
- Algorithms for measuring perturbality in matroid optimization
- On the computation of pfaffians
- Recent results on approximating the Steiner tree problem and its generalizations
- Randomized algorithms over finite fields for the exact parity base problem.
- Budgeted colored matching problems
- Weighted matching with pair restrictions
- The combinatorial approach yields an NC algorithm for computing Pfaffians
- Random parallel algorithms for finding exact branchings, perfect matchings, and cycles
- New algorithms for linear \(k\)-matroid intersection and matroid \(k\)-parity problems
- A cost-scaling algorithm for computing the degree of determinants
- A simple PTAS for weighted matroid matching on strongly base orderable matroids
- Combination algorithms for Steiner tree variants
- Algebraic algorithms for linear matroid parity problems
- The Medusa algorithm for polynomial matings
- Solving NP-hard semirandom graph problems in polynomial expected time
- Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle
- New approaches to multi-objective optimization
- On the difficulty of finding walks of length k
- Towards a polynomial-time randomized algorithm for closed product-form networks
- Bounding the payment of approximate truthful mechanisms
- Generalized center problems with outliers
- Generalized center problems with outliers
- RNC-approximation algorithms for the steiner problem
- A constant approximation for colorful k-center
- Weighted linear matroid parity
- A weighted linear matroid parity algorithm
- Approximating bounded degree deletion via matroid matching
- Budgeted matching and budgeted matroid intersection via the gasoline puzzle
- Advances on strictly \(\varDelta \)-modular IPs
- Obtaining approximately optimal and diverse solutions via dispersion
- A combinatorial algorithm for computing the entire sequence of the maximum degree of minors of a generic partitioned polynomial matrix with 2 2 submatrices
- Problems on group-labeled matroid bases
- Lower bounds for matroid optimization problems with a linear constraint
- Pandora's box problem with time constraints
- On the exact matching problem in dense graphs
- Exact matching: correct parity and FPT parameterized by independence number
- Techniques for generalized colorful k-center problems
- Analysis of the two-for-one swap heuristic for approximating the maximum independent set in a k-polymatroid
- Advances on strictly -modular IPs
- On the congruency-constrained matroid base
- New results on a general class of minimum norm optimization problems
- Towards the proximity conjecture on group-labeled matroids
- Parameterized algorithms for matching integer programs with additional rows and columns
This page was built for publication: Random pseudo-polynomial algorithms for exact matroid problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3990608)
