Publication:2934608
From MaRDI portal
zbMath1302.90169MaRDI QIDQ2934608
Sing-Hoi Sze, Songjian Lu, Fenghui Zhang, Jian'er Chen
Publication date: 18 December 2014
68W05: Nonnumerical algorithms
90C27: Combinatorial optimization
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
68W25: Approximation algorithms
Related Items
Improved Algorithms for Several Parameterized Problems Based on Random Methods, On Counting Parameterized Matching and Packing, Unnamed Item, Unnamed Item, Finding Detours is Fixed-Parameter Tractable, 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, FPT-Algorithms for the \(\ell\) -Matchoid Problem with a Coverage Objective, Detours in directed graphs, Randomized fixed-parameter algorithms for the closest string problem, 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, Confronting intractability via parameters, Finding monotone paths in edge-ordered graphs, Data reductions, fixed parameter tractability, and random weighted \(d\)-CNF satisfiability, Interval scheduling and colorful independent sets, 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, 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, Approximating multilinear monomial coefficients and maximum multilinear monomials in multivariate polynomials, 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_2\)-packing and co-path packing problems, 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, 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, The Budgeted Unique Coverage Problem and Color-Coding, Randomized Disposal of Unknowns and Implicitly Enforced Bounds on Parameters, Improved Parameterized Algorithms for Weighted 3-Set Packing, A Problem Kernelization for Graph Packing, Kernelization: New Upper and Lower Bound Techniques
