Partition on trees with supply and demand: kernelization and algorithms
DOI10.1016/J.TCS.2016.06.044zbMATH Open1356.68104OpenAlexW2466022259MaRDI QIDQ507429FDOQ507429
Jianer Chen, Wen-Jun Li, Qilong Feng, Mugang Lin
Publication date: 6 February 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.06.044
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10) Nonnumerical algorithms (68W05)
Cites Work
- Title not available (Why is that?)
- Fundamentals of parameterized complexity
- Approximability of partitioning graphs with supply and demand
- Minimum cost partitions of trees with supply and demand
- A heuristic method for solving the problem of partitioning graphs with supply and demand
- Modelling the Power Supply Network – Hardness and Approximation
- Tree \(t\)-spanners in outerplanar graphs via supply demand partition
- PARTITIONING TREES OF SUPPLY AND DEMAND
- Parameterized Algorithms
- A parameterized study of maximum generalized pattern matching problems
- Randomized parameterized algorithms for \(P_2\)-packing and co-path packing problems
- Parameterized complexity of control and bribery for \(d\)-approval elections
- Matching and weighted \(P_2\)-packing: algorithms and kernels
- Facility location problems: a parameterized view
- Parameterized complexity of Min-power multicast problems in wireless ad hoc networks
- Improved parameterized algorithms for minimum link-length rectilinear spanning path problem
- Parametric power supply networks
- Dealing with 4-Variables by Resolution: An Improved MaxSAT Algorithm
- Partitioning graphs of supply and demand
Cited In (8)
- Minimum Cost Partitions of Trees with Supply and Demand
- Parameterized algorithms for edge biclique and related problems
- An improved FPT algorithm for almost forest deletion problem
- Parameterized Minimum Cost Partition of a Tree with Supply and Demand
- An improved linear kernel for complementary maximal strip recovery: simpler and smaller
- An approximation algorithm for the \(l\)-pseudoforest deletion problem
- Improved PTAS for the constrained \(k\)-means problem
- Dealing with several parameterized problems by random methods
This page was built for publication: Partition on trees with supply and demand: kernelization and algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q507429)
