Polynomial-time data reduction for weighted problems beyond additive goal functions
From MaRDI portal
Recommendations
- Data reductions and combinatorial bounds for improved approximation algorithms
- Data reductions, fixed parameter tractability, and random weighted d-CNF satisfiability
- Polynomial-time data reduction for dominating set
- Polynomial-time data reduction for the subset interconnection design problem
- Polylogarithmic Approximation Algorithms for Weighted-ℱ-deletion Problems
- Polylogarithmic approximation algorithms for weighted-\(\mathcal{F}\)-deletion problems
- Parameterized complexity of weighted satisfiability problems
- Optimal data reduction for graph coloring using low-degree polynomials
- Optimal data reduction for graph coloring using low-degree polynomials
- Polynomial-time algorithms for multivariate linear problems with finite-order weights: worst case setting
Cites work
- \(W[2]\)-hardness of precedence constrained \(K\)-processor scheduling
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- An application of simultaneous diophantine approximation in combinatorial optimization
- Approximations for minimum and min-max vehicle routing problems
- Arc Routing
- Arc routing problems with min-max objectives
- Chamberlin-Courant rule with approval ballots: approximating the MaxCover problem with bounded frequencies in FPT time
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Constant-factor approximations for capacitated arc routing without triangle inequality
- Facility location problems: a parameterized view
- Factoring polynomials with rational coefficients
- Fixed-parameter algorithms for maximum-profit facility location under matroid constraints
- Fixed-Parameter Algorithms for Minimum-Cost Edge-Connectivity Augmentation
- Geometric algorithms and combinatorial optimization
- Graph expansion and the unique games conjecture
- Graph Layout Problems Parameterized by Vertex Cover
- scientific article; zbMATH DE number 3644821 (Why is no real title available?)
- scientific article; zbMATH DE number 3550186 (Why is no real title available?)
- Location science
- Min-Max Graph Partitioning and Small Set Expansion
- New algorithms for minimizing the weighted number of tardy jobs on a single machine
- On the complexity of Chamberlin-Courant on almost structured profiles
- On the parametric complexity of schedules to minimize tardy tasks.
- Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks
- Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments
- Parameterized complexity of machine scheduling: 15 open problems
- Polynomial algorithms in linear programming
- Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width
- Reducibility among combinatorial problems
- The complexity of arc routing problems
- The ellipsoid method and its consequences in combinatorial optimization
This page was built for publication: Polynomial-time data reduction for weighted problems beyond additive goal functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2685700)
