Pages that link to "Item:Q4630247"

The following pages link to The approximation of maximum subgraph problems (Q4630247):

Displaying 50 items.

• Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations (Q360375) (← links)
• Reoptimization of maximum weight induced hereditary subgraph problems (Q386899) (← links)
• Complexity of finding maximum regular induced subgraphs with prescribed degree (Q401302) (← links)
• A survey on the structure of approximation classes (Q458503) (← links)
• Bandwidth allocation in cellular networks with multiple interferences (Q494422) (← links)
• On the max min vertex cover problem (Q499339) (← links)
• The maximum \(k\)-colorable subgraph problem and orbitopes (Q666000) (← links)
• Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization (Q856420) (← links)
• Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties (Q955347) (← links)
• An improved algorithm for the longest induced path problem on \(k\)-chordal graphs (Q1005252) (← links)
• Approximating the maximum clique minor and some subgraph homeomorphism problems (Q1022596) (← links)
• A new approach for approximating node deletion problems (Q1029021) (← links)
• A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound (Q1071037) (← links)
• A unified approximation algorithm for node-deletion problems (Q1270821) (← links)
• Finding optimal subgraphs by local search (Q1392027) (← links)
• Domination analysis of combinatorial optimization problems. (Q1406045) (← links)
• Local approximations for maximum partial subgraph problem. (Q1426723) (← links)
• Approximating minimum feedback vertex sets in hypergraphs (Q1583598) (← links)
• Optimal approximation algorithms for maximum distance-bounded subgraph problems (Q1635712) (← links)
• Online algorithms for the maximum \(k\)-colorable subgraph problem (Q1652561) (← links)
• Optimizing adiabatic quantum program compilation using a graph-theoretic framework (Q1654155) (← links)
• PTAS for \(\mathcal{H}\)-free node deletion problems in disk graphs (Q1706122) (← links)
• Fast constructive and improvement heuristics for edge clique covering (Q2019428) (← links)
• The maximum happy induced subgraph problem: bounds and algorithms (Q2026981) (← links)
• An approximation algorithm for the maximum spectral subgraph problem (Q2082202) (← links)
• Characterization of QUBO reformulations for the maximum \(k\)-colorable subgraph problem (Q2107015) (← links)
• Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization (Q2437764) (← links)
• Induced acyclic tournaments in random digraphs: sharp concentration, thresholds and algorithms (Q2509535) (← links)
• Strong hardness of approximation for tree transversals (Q2681395) (← links)
• On the \(d\)-claw vertex deletion problem (Q2695329) (← links)
• Hitting forbidden minors: approximation and kernelization (Q2790404) (← links)
• Improved bounds on induced acyclic subgraphs in random digraphs (Q2821620) (← links)
• (Q3688418) (← links)
• Tight Bounds for the Maximum Acyclic Subgraph Problem (Q4366872) (← links)
• A primal-dual approach to approximation of node-deletion problems for matroidal properties (Q4572003) (← links)
• (Q4780790) (← links)
• (Q5009491) (← links)
• Proximity Search for Maximal Subgraph Enumeration (Q5048293) (← links)
• (Q5075776) (← links)
• The Maximum <i>k</i>-Colorable Subgraph Problem and Related Problems (Q5084675) (← links)
• (Q5090466) (← links)
• Inductive graph invariants and approximation algorithms (Q5101914) (← links)
• From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More (Q5115701) (← links)
• A Linear-Time Algorithm for Finding Induced Planar Subgraphs (Q5140735) (← links)
• Inapproximability of $H$-Transversal/Packing (Q5348212) (← links)
• Towards Finding Maximal Subrelations with Desired Properties (Q5410494) (← links)
• Algorithms – ESA 2005 (Q5475891) (← links)
• The maximum feasible subset problem (maxFS) and applications (Q5884385) (← links)
• A polyhedral study of the maximum edge subgraph problem (Q5891092) (← links)
• On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs (Q5900085) (← links)