Pages that link to "Item:Q1305935"

The following pages link to Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems (Q1305935):

Displaying 47 items.

• PTAS for densest \(k\)-subgraph in interval graphs (Q261389) (← links)
• Tight complexity bounds for FPT subgraph problems parameterized by the clique-width (Q388791) (← links)
• Approximating vertex cover in dense hypergraphs (Q450531) (← links)
• Approximating \(k\)-generalized connectivity via collapsing HSTs (Q491201) (← links)
• Nearly tight approximation bounds for vertex cover on dense \(k\)-uniform \( k\)-partite hypergraphs (Q491613) (← links)
• Semidefinite approximations for quadratic programs over orthogonal matrices (Q609564) (← links)
• Integer point sets minimizing average pairwise \(L_{1}\) distance: What is the optimal shape of a town? (Q621921) (← links)
• Fair and efficient cake division with connected pieces (Q776236) (← links)
• Approximate \(k\)-Steiner forests via the Lagrangian relaxation technique with internal preprocessing (Q848846) (← links)
• On the approximation of correlation clustering and consensus clustering (Q931713) (← links)
• Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem (Q1683124) (← links)
• The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets (Q1730227) (← links)
• On the weighted quartet consensus problem (Q1737590) (← links)
• Polynomial approximation algorithms with performance guarantees: an introduction-by-example (Q1771343) (← links)
• Improved approximations for max set splitting and max NAE SAT (Q1878408) (← links)
• Improved approximation for spanning star forest in dense graphs (Q1944390) (← links)
• In search of the densest subgraph (Q2005555) (← links)
• An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance (Q2018887) (← links)
• Classical symmetries and the quantum approximate optimization algorithm (Q2099573) (← links)
• The maximum exposure problem (Q2123293) (← links)
• Domination chain: characterisation, classical complexity, parameterised complexity and approximability (Q2181241) (← links)
• Additive approximation for edge-deletion problems (Q2389218) (← links)
• On the \(k\)-edge-incident subgraph problem and its variants (Q2446891) (← links)
• The complexity of detecting fixed-density clusters (Q2499577) (← links)
• Genus characterizes the complexity of certain graph problems: Some tight results (Q2641866) (← links)
• On the Complexity Landscape of the Domination Chain (Q2795935) (← links)
• Approximating subdense instances of covering problems (Q2840726) (← links)
• The Approximability of Maximum Rooted Triplets Consistency with Fan Triplets and Forbidden Triplets (Q2942263) (← links)
• On Variants of the Spanning Star Forest Problem (Q3004657) (← links)
• Introduction to Testing Graph Properties (Q3088198) (← links)
• Approximation of the Quadratic Knapsack Problem (Q3186661) (← links)
• Approximation Algorithms for Geometric Intersection Graphs (Q3508563) (← links)
• Parallel approximation to high multiplicity scheduling problems<i>VIA</i>smooth multi-valued quadratic programming (Q3515460) (← links)
• Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : de la structure de NPO à la structure des instances (Q4457892) (← links)
• On percolation and ‐hardness (Q4633317) (← links)
• Contribution of copositive formulations to the graph partitioning problem (Q4916308) (← links)
• Sublinear-time Algorithms (Q4933363) (← links)
• Introduction to Testing Graph Properties (Q4933365) (← links)
• Simplex Transformations and the Multiway Cut Problem (Q5000653) (← links)
• Constrained Assortment Optimization Under the Paired Combinatorial Logit Model (Q5080643) (← links)
• A Polynomial-Time Algorithm to Determine (Almost) Hamiltonicity of Dense Regular Graphs (Q5084096) (← links)
• (Q5089231) (← links)
• Dynamic Balanced Graph Partitioning (Q5130579) (← links)
• Weighted Upper Edge Cover: Complexity and Approximability (Q5216282) (← links)
• Mathematical Foundations of Computer Science 2004 (Q5311124) (← links)
• On solving the densest<i>k</i>-subgraph problem on large graphs (Q5859000) (← links)
• The Maximum Exposure Problem. (Q5875471) (← links)