Representative Families: A Unified Tradeoff-Based Approach

DOI10.1007/978-3-662-44777-2_65zbMath1333.68265arXiv1402.3547OpenAlexW2753014589MaRDI QIDQ2921462

Meirav Zehavi, Hadas Shachnai

Publication date: 8 October 2014

Published in: Algorithms - ESA 2014 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1402.3547

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (17)

A randomized algorithm for long directed cycle ⋮ Spotting Trees with Few Leaves ⋮ Spotting Trees with Few Leaves ⋮ Deterministic Truncation of Linear Matroids ⋮ A 2k-vertex Kernel for Maximum Internal Spanning Tree ⋮ Fast Algorithms for Parameterized Problems with Relaxed Disjointness Constraints ⋮ A Multivariate Approach for Weighted FPT Algorithms ⋮ Mixing Color Coding-Related Techniques ⋮ Deterministic parameterized algorithms for the graph motif problem ⋮ Parameterized approximation algorithms for packing problems ⋮ Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets ⋮ Parameterized algorithms for graph partitioning problems ⋮ Algorithms for \(k\)-internal out-branching and \(k\)-tree in bounded degree graphs ⋮ Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree ⋮ The \(k\)-distinct language: parameterized automata constructions ⋮ Linear representation of transversal matroids and gammoids parameterized by rank ⋮ On the complexity of algorithms for detecting \(k\)-length negative cost cycles

This page was built for publication: Representative Families: A Unified Tradeoff-Based Approach