Pages that link to "Item:Q4234075"
From MaRDI portal
The following pages link to Polynomial time approximation schemes for dense instances of NP-hard problems (Q4234075):
Displaying 50 items.
- Chromatic kernel and its applications (Q266072) (← links)
- On the efficiency of polynomial time approximation schemes (Q290268) (← links)
- A lower bound of \(8/(7+\frac{1}{k-1})\) on the integrality ratio of the Călinescu-Karloff-Rabani relaxation for multiway cut (Q294793) (← links)
- Testability of minimum balanced multiway cut densities (Q423907) (← links)
- A new Lagrangian net algorithm for solving max-bisection problems (Q544198) (← links)
- Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION (Q679447) (← links)
- An efficient algorithm for solving pseudo clique enumeration problem (Q848935) (← links)
- Integer and fractional packings of hypergraphs (Q864903) (← links)
- A constant approximation algorithm for the densest \(k\)-subgraph problem on chordal graphs (Q963469) (← links)
- Balanced cut approximation in random geometric graphs (Q1029344) (← links)
- Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems (Q1305935) (← links)
- Constructing the highest degree subgraph for dense graphs is in \({\mathcal N}{\mathcal C}{\mathcal A}{\mathcal S}\) (Q1351969) (← links)
- An improved approximation algorithm of MULTIWAY CUT. (Q1577011) (← links)
- Fast stabbing of boxes in high dimensions (Q1583093) (← links)
- A randomized approximation scheme for metric MAX-CUT (Q1604207) (← links)
- Complexity of finding dense subgraphs (Q1613384) (← links)
- Parallel approximation schemes for a class of planar and near planar combinatorial optimization problems. (Q1854505) (← links)
- Approximate and dynamic rank aggregation (Q1884843) (← links)
- Bounds on the max and min bisection of random cubic and random 4-regular graphs (Q1885048) (← links)
- Random sampling and approximation of MAX-CSPs (Q1886453) (← links)
- Improved non-approximability results for minimum vertex cover with density constraints (Q1960657) (← links)
- A simple algorithm for the multiway cut problem (Q2294387) (← links)
- Near optimal solutions for maximum quasi-bicliques (Q2377385) (← links)
- Finding connected \(k\)-subgraphs with high density (Q2407097) (← links)
- The densest \(k\)-subgraph problem on clique graphs (Q2426654) (← links)
- A multiple penalty function method for solving max-bisection problems (Q2489432) (← links)
- Hardness of fully dense problems (Q2643075) (← links)
- Algorithms for graph partitioning on the planted partition model (Q2712576) (← links)
- Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width (Q2891349) (← links)
- Finding Connected Dense $$k$$-Subgraphs (Q2948471) (← links)
- How to Cut a Graph into Many Pieces (Q3010400) (← links)
- Approximation Schemes for the Betweenness Problem in Tournaments and Related Ranking Problems (Q3088101) (← links)
- String-Matching and Alignment Algorithms for Finding Motifs in NGS Data (Q3305534) (← links)
- Sampling subproblems of heterogeneous Max-Cut problems and approximation algorithms (Q3503606) (← links)
- Parallel approximation to high multiplicity scheduling problems<i>VIA</i>smooth multi-valued quadratic programming (Q3515460) (← links)
- Polynomial time approximation schemes for dense instances of minimum constraint satisfaction (Q4417004) (← links)
- Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : de la structure de NPO à la structure des instances (Q4457892) (← links)
- Polynomial time approximation of dense weighted instances of MAX-CUT (Q4500688) (← links)
- Simplex Partitioning via Exponential Clocks and the Multiway-Cut Problem (Q4577771) (← links)
- Integer and fractional packings in dense 3‐uniform hypergraphs (Q4805219) (← links)
- Sublinear Algorithms for MAXCUT and Correlation Clustering (Q5002682) (← links)
- Greedily finding a dense subgraph (Q5054810) (← links)
- A Polynomial-Time Algorithm to Determine (Almost) Hamiltonicity of Dense Regular Graphs (Q5084096) (← links)
- (Q5111755) (← links)
- Amplification and Derandomization without Slowdown (Q5129234) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311124) (← links)
- An Efficient Algorithm for Enumerating Pseudo Cliques (Q5387774) (← links)
- Maximum dispersion problem in dense graphs (Q5929139) (← links)
- On the parallel approximability of a subclass of quadratic programming. (Q5941277) (← links)
- On point covers of \(c-\)oriented polygons (Q5941498) (← links)
