scientific article; zbMATH DE number 7376021
From MaRDI portal
Publication:5002776
DOI10.4230/LIPIcs.ICALP.2018.94zbMath1499.68154arXiv1802.06026MaRDI QIDQ5002776
Publication date: 28 July 2021
Full work available at URL: https://arxiv.org/abs/1802.06026
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms (68W40) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85) Parameterized complexity, tractability and kernelization (68Q27)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tree metrics and edge-disjoint \(S\)-paths
- Parameterized graph separation problems
- A parameterized view on matroid optimization problems
- A fast algorithm for constructing trees from distance matrices
- Minimum 0-extensions of graph metrics
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- An improved parameterized algorithm for the minimum node multiway cut problem
- A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results
- Half-integrality, LP-branching, and FPT Algorithms
- Submodularity on a Tree: Unifying $L^\natural$ -Convex and Bisubmodular Functions
- The Complexity of Finite-Valued CSPs
- Designing FPT Algorithms for Cut Problems Using Randomized Contractions
- Approximation algorithms for classification problems with pairwise relationships
- On Earthmover Distance, Metric Labeling, and 0-Extension
- A Cut Approach to the Rectilinear Distance Facility Location Problem
- LP-branching algorithms based on biased graphs
- The Maximum Multiflow Problems with Bounded Fractionality
- The Complexity of General-Valued CSPs
- The Hardness of Metric Labeling
- Fixed-Parameter Tractability of Multicut Parameterized by the Size of the Cutset
- A tight bound on approximating arbitrary metrics by tree metrics
- Discrete convexity and polynomial solvability in minimum 0-extension problems
This page was built for publication:
