Improved algorithms for path, matching, and packing problems
From MaRDI portal
Recommendations
- Randomized divide-and-conquer: improved path, matching, and packing algorithms
- Greedy Localization and Color-Coding: Improved Matching and Packing Algorithms
- Algorithms – ESA 2004
- Faster fixed-parameter tractable algorithms for matching and packing problems
- Narrow sieves for parameterized paths and packings
Cited in
(54)- Improved parameterized set splitting algorithms: A Probabilistic approach
- On counting 3-D matchings of size \(k\)
- Maximum disjoint paths on edge-colored graphs: approximability and tractability
- Using nondeterminism to design efficient deterministic algorithms
- Parameterized random complexity
- Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas
- A note on algebraic techniques for subgraph detection
- Randomized parameterized algorithms for P₂-packing and co-path packing problems
- Narrow sieves for parameterized paths and packings
- Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs
- Sharp separation and applications to exact and parameterized algorithms
- An \(O^{*}(3.53^{3k})\)-time parameterized algorithm for the 3-set packing problem
- Randomized fixed-parameter algorithms for the closest string problem
- Parameterized counting matching and packing: a family of hard problems that admit FPTRAS
- Dealing with several parameterized problems by random methods
- Kernel bounds for path and cycle problems
- scientific article; zbMATH DE number 6719727 (Why is no real title available?)
- Exact covers via determinants
- The Budgeted Unique Coverage Problem and Color-Coding
- Greedy Localization and Color-Coding: Improved Matching and Packing Algorithms
- Randomized Disposal of Unknowns and Implicitly Enforced Bounds on Parameters
- Improved Parameterized Algorithms for Weighted 3-Set Packing
- Faster Algebraic Algorithms for Path and Packing Problems
- Divide-and-Color
- A Problem Kernelization for Graph Packing
- Randomized divide-and-conquer: improved path, matching, and packing algorithms
- Kernelization: new upper and lower bound techniques
- On testing monomials in multivariate polynomials
- Parameterized complexity of max-lifetime target coverage in wireless sensor networks
- Kernel bounds for path and cycle problems
- Faster algorithms for finding and counting subgraphs
- scientific article; zbMATH DE number 2081099 (Why is no real title available?)
- Improved algorithms for several parameterized problems based on random methods
- On counting parameterized matching and packing
- Confronting intractability via parameters
- Finding detours is fixed-parameter tractable
- Patching colors with tensors
- Going far from degeneracy
- Going far from degeneracy
- Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem
- A Parameterized Perspective on Packing Paths of Length Two
- 1.61-approximation for min-power strong connectivity with two power levels
- Finding monotone paths in edge-ordered graphs
- FPT-Algorithms for the \(\ell\) -Matchoid Problem with a Coverage Objective
- Detours in directed graphs
- Parameterized algorithms for the spanning forest isomorphism and containment on tree
- Parameterized algorithms for the spanning forest isomorphism (or containment) on tree problems
- Methods for finding paths of a prescribed length in weighted graphs
- Data reductions, fixed parameter tractability, and random weighted d-CNF satisfiability
- Parameterized algorithms for weighted matching and packing problems
- Algorithm engineering for color-coding with applications to signaling pathway detection
- Faster fixed-parameter tractable algorithms for matching and packing problems
- Efficient algorithms for clique problems
- Finding paths of length \(k\) in \(O^{*}(2^k)\) time
This page was built for publication: Improved algorithms for path, matching, and packing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2934608)
