scientific article; zbMATH DE number 1342117
From MaRDI portal
Publication:4263699
zbMath0948.90122MaRDI QIDQ4263699
Publication date: 27 November 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (42)
Approximation algorithms for the maximum vertex coverage problem on bounded degree graphs ⋮ Cardinality constrained path covering problems in grid graphs ⋮ Parameterized Algorithms for Partial Vertex Covers in Bipartite Graphs ⋮ Max-Cut Under Graph Constraints ⋮ Purely combinatorial approximation algorithms for maximum \(k\)-vertex cover in bipartite graphs ⋮ Constrained Assortment Optimization Under the Paired Combinatorial Logit Model ⋮ On the fixed-parameter tractability of the partial vertex cover problem with a matching constraint in edge-weighted bipartite graphs ⋮ Combinatorial approximation of maximum k-vertex cover in bipartite graphs within ratio 0.7 ⋮ Discrete Stochastic Submodular Maximization: Adaptive vs. Non-adaptive vs. Offline ⋮ A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis ⋮ Computing densest \(k\)-subgraph with structural parameters ⋮ Parameterized exact and approximation algorithms for maximumk-set cover and related satisfiability problems ⋮ A parameterized approximation scheme for generalized partial vertex cover ⋮ Coverage, Matching, and Beyond: New Results on Budgeted Mechanism Design ⋮ On the partial vertex cover problem in bipartite graphs -- a parameterized perspective ⋮ Matroid-constrained vertex cover ⋮ Maximum Weighted Independent Sets with a Budget ⋮ Online maximum \(k\)-coverage ⋮ Cardinality constrained minimum cut problems: complexity and algorithms. ⋮ The maximum vertex coverage problem on bipartite graphs ⋮ Approximation algorithms for maximum cut with limited unbalance ⋮ On nonlinear multi-covering problems ⋮ The generalized maximum coverage problem ⋮ An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints ⋮ An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance ⋮ \((k,n-k)\)-\textsc{Max-Cut}: an \(\mathcal{O}^*(2^p)\)-time algorithm and a polynomial kernel ⋮ Approximating graph-constrained max-cut ⋮ Approximating max-cut under graph-MSO constraints ⋮ Maximum Betweenness Centrality: Approximability and Tractable Cases ⋮ Online Maximum k-Coverage ⋮ Randomized Rounding in the Presence of a Cardinality Constraint ⋮ Partial Vertex Cover and Budgeted Maximum Coverage in Bipartite Graphs ⋮ Better streaming algorithms for the maximum coverage problem ⋮ On interval and circular-arc covering problems ⋮ Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines ⋮ Parameterized complexity of multi-node hubs ⋮ On approximation of max-vertex-cover ⋮ Multi-parameter analysis for local graph partitioning problems: using greediness for parameterization ⋮ Improved approximation of maximum vertex cover ⋮ Approximation algorithms for maximum linear arrangement ⋮ Approximating the maximum quadratic assignment problem ⋮ Improved approximation algorithms for maximum graph partitioning problems
This page was built for publication:
