Pages that link to "Item:Q1186548"

The following pages link to Optimization, approximation, and complexity classes (Q1186548):

Displaying 50 items.

• Some recent strong inapproximability results (Q5054856) (← links)
• On approximation properties of the Independent set problem for degree 3 graphs (Q5057456) (← links)
• Approximation of Constraint Satisfaction via local search (Q5057457) (← links)
• On Geometric Set Cover for Orthants (Q5075763) (← links)
• Definable Inapproximability: New Challenges for Duplicator (Q5079727) (← links)
• The Maximum <i>k</i>-Colorable Subgraph Problem and Related Problems (Q5084675) (← links)
• On the fixed-parameter tractability of the partial vertex cover problem with a matching constraint in edge-weighted bipartite graphs (Q5084707) (← links)
• On the approximability of some maximum spanning tree problems (Q5096340) (← links)
• Graph layout problems (Q5096816) (← links)
• Intractability of assembly sequencing: Unit disks in the plane (Q5096948) (← links)
• Quantum Annealing versus Digital Computing (Q5102052) (← links)
• An Exact Method for the Minimum Feedback Arc Set Problem (Q5102057) (← links)
• Maximum Cut Parameterized by Crossing Number (Q5119374) (← links)
• Max-independent set and the quantum alternating operator ansatz (Q5130754) (← links)
• New Valid Inequalities for the Optimal Communication Spanning Tree Problem (Q5138258) (← links)
• MAXIMUM WEIGHT CYCLE PACKING IN DIRECTED GRAPHS, WITH APPLICATION TO KIDNEY EXCHANGE PROGRAMS (Q5189989) (← links)
• Cost minimization in wireless networks with a bounded and unbounded number of interfaces (Q5191147) (← links)
• (Q5216300) (← links)
• On the Complexity of Finding a Potential Community (Q5283357) (← links)
• On Finding Small 2-Generating Sets (Q5323086) (← links)
• Partial Vertex Cover and Budgeted Maximum Coverage in Bipartite Graphs (Q5361234) (← links)
• Grothendieck’s Theorem, past and present (Q5389600) (← links)
• On Maximum Edge Cuts of Connected Digraphs (Q5418765) (← links)
• Approximation Classes for Real Number Optimization Problems (Q5429213) (← links)
• The Minimum Substring Cover Problem (Q5443381) (← links)
• On the Approximability of Comparing Genomes with Duplicates (Q5452150) (← links)
• Order Scheduling Models: Hardness and Algorithms (Q5458825) (← links)
• A Logical Approach to Constraint Satisfaction (Q5504702) (← links)
• Polynomial Time Approximation Scheme for Connected Vertex Cover in Unit Disk Graph (Q5505664) (← links)
• (Q5708499) (← links)
• COMPLETENESS IN DIFFERENTIAL APPROXIMATION CLASSES (Q5714673) (← links)
• (Q5743434) (← links)
• Linear game non-contextuality and Bell inequalities—a graph-theoretic approach (Q5855038) (← links)
• Algorithmic complexity of weakly connected Roman domination in graphs (Q5866025) (← links)
• Stackelberg Max Closure with Multiple Followers (Q5870364) (← links)
• (Q5874481) (← links)
• When polynomial approximation meets exact computation (Q5892165) (← links)
• Theory and Applications of Models of Computation (Q5898889) (← links)
• On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs (Q5900085) (← links)
• Repetition-free longest common subsequence (Q5900087) (← links)
• On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs (Q5901067) (← links)
• Repetition-free longest common subsequence (Q5901069) (← links)
• When polynomial approximation meets exact computation (Q5915964) (← links)
• Maximizing agreements with one-sided error with applications to heuristic learning (Q5916204) (← links)
• The temporal explorer who returns to the base (Q5918316) (← links)
• On the complexity of minimum maximal uniquely restricted matching (Q5918362) (← links)
• Lower bounds for the happy coloring problems (Q5918935) (← links)
• Approximability of covering cells with line segments (Q5919568) (← links)
• Maximizing agreements with one-sided error with applications to heuristic learning (Q5921687) (← links)
• Near optimal multiple alignment within a band in polynomial time (Q5925273) (← links)