scientific article; zbMATH DE number 1342117
From MaRDI portal
Publication:4263699
Recommendations
Cited in
(51)- Cardinality constrained minimum cut problems: complexity and algorithms.
- Approximation algorithms for maximum linear arrangement
- Approximating the maximum quadratic assignment problem
- Purely combinatorial approximation algorithms for maximum \(k\)-vertex cover in bipartite graphs
- \((k,n-k)\)-\textsc{Max-Cut}: an \(\mathcal{O}^*(2^p)\)-time algorithm and a polynomial kernel
- Approximating graph-constrained max-cut
- On approximation of max-vertex-cover
- Pipage rounding: a new method of constructing algorithms with proven performance guarantee
- An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance
- Parameterized complexity of multi-node hubs
- Approximating max-cut under graph-MSO constraints
- Better streaming algorithms for the maximum coverage problem
- On interval and circular-arc covering problems
- Multi-parameter analysis for local graph partitioning problems: using greediness for parameterization
- The maximum vertex coverage problem on bipartite graphs
- Approximation algorithms for maximum cut with limited unbalance
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
- Improved approximation of maximum vertex cover
- Computing densest \(k\)-subgraph with structural parameters
- A 0. 5-approximation algorithm for MAX DICUT with given sizes of parts
- Randomized rounding in the presence of a cardinality constraint
- Discrete stochastic submodular maximization: adaptive vs. non-adaptive vs. offline
- Parameterized exact and approximation algorithms for maximum k-set cover and related satisfiability problems
- Coverage, matching, and beyond: new results on budgeted mechanism design
- Maximum weighted independent sets with a budget
- Maximum betweenness centrality: approximability and tractable cases
- Online maximum \(k\)-coverage
- Cardinality constrained path covering problems in grid graphs
- Max-cut under graph constraints
- Online maximum \(k\)-coverage
- Combinatorial approximation of maximum \(k\)-vertex cover in bipartite graphs within ratio 0,7
- Algorithms with large domination ratio
- Parameterized Algorithms for Partial Vertex Covers 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
- On nonlinear multi-covering problems
- Partial vertex cover and budgeted maximum coverage in bipartite graphs
- A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis
- A parameterized approximation scheme for generalized partial vertex cover
- On the partial vertex cover problem in bipartite graphs -- a parameterized perspective
- Matroid-constrained vertex cover
- A note on robust subsets of transversal matroids
- Improved FPT approximation scheme and approximate kernel for biclique-free max k-weight SAT: greedy strikes back
- Separating coverage and submodular: maximization subject to a cardinality constraint
- Optirefine: densest subgraphs and maximum cuts with k refinements
- An improved approximation algorithm for hypergraph max p-section
- SubModST: a fast generic solver for submodular maximization with size constraints
- An improved SDP rounding approximation algorithm for the max hypergraph bisection
- Improved approximation algorithms for maximum graph partitioning problems
- Approximation algorithms for the maximum vertex coverage problem on bounded degree graphs
- The generalized maximum coverage problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4263699)
