scientific article
From MaRDI portal
Publication:2934608
zbMath1302.90169MaRDI QIDQ2934608
Sing-Hoi Sze, Songjian Lu, Fenghui Zhang, Jian'er Chen
Publication date: 18 December 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nonnumerical algorithms (68W05) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Approximation algorithms (68W25)
Related Items (44)
A note on algebraic techniques for subgraph detection ⋮ Kernel Bounds for Path and Cycle Problems ⋮ Data reductions, fixed parameter tractability, and random weighted \(d\)-CNF satisfiability ⋮ Parameterized counting matching and packing: a family of hard problems that admit FPTRAS ⋮ Dealing with several parameterized problems by random methods ⋮ Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem ⋮ Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs ⋮ Finding monotone paths in edge-ordered graphs ⋮ On testing monomials in multivariate polynomials ⋮ Parameterized complexity of max-lifetime target coverage in wireless sensor networks ⋮ Kernel bounds for path and cycle problems ⋮ Interval scheduling and colorful independent sets ⋮ Randomized Disposal of Unknowns and Implicitly Enforced Bounds on Parameters ⋮ FPT-Algorithms for the \(\ell\) -Matchoid Problem with a Coverage Objective ⋮ Detours in directed graphs ⋮ Improved Parameterized Algorithms for Weighted 3-Set Packing ⋮ Approximating multilinear monomial coefficients and maximum multilinear monomials in multivariate polynomials ⋮ Sharp separation and applications to exact and parameterized algorithms ⋮ An \(O^{*}(3.53^{3k})\)-time parameterized algorithm for the 3-set packing problem ⋮ Parameterized random complexity ⋮ Faster algorithms for finding and counting subgraphs ⋮ Going Far from Degeneracy ⋮ Confronting intractability via parameters ⋮ Improved Algorithms for Several Parameterized Problems Based on Random Methods ⋮ On Counting Parameterized Matching and Packing ⋮ Maximum disjoint paths on edge-colored graphs: approximability and tractability ⋮ 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 ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Efficient algorithms for clique problems ⋮ Finding paths of length \(k\) in \(O^{*}(2^k)\) time ⋮ A Problem Kernelization for Graph Packing ⋮ 1.61-approximation for min-power strong connectivity with two power levels ⋮ Finding Detours is Fixed-Parameter Tractable ⋮ The Budgeted Unique Coverage Problem and Color-Coding ⋮ Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas ⋮ Kernelization: New Upper and Lower Bound Techniques ⋮ Improved parameterized set splitting algorithms: A Probabilistic approach ⋮ On counting 3-D matchings of size \(k\) ⋮ A Parameterized Perspective on Packing Paths of Length Two ⋮ Randomized parameterized algorithms for \(P_2\)-packing and co-path packing problems ⋮ Randomized fixed-parameter algorithms for the closest string problem
This page was built for publication:
