Pages that link to "Item:Q1186548"
From MaRDI portal
The following pages link to Optimization, approximation, and complexity classes (Q1186548):
Displaying 50 items.
- Combined super-/substring and super-/subsequence problems (Q596093) (← links)
- Lagrangean bounds for the optimum communication spanning tree problem (Q611003) (← links)
- Separator-based data reduction for signed graph balancing (Q613659) (← links)
- The Stackelberg minimum spanning tree game (Q627533) (← links)
- Uniform unweighted set cover: the power of non-oblivious local search (Q631761) (← links)
- Computing bond orders in molecule graphs (Q631782) (← links)
- Derandomized parallel repetition via structured PCPs (Q645129) (← links)
- A note on approximation of the vertex cover and feedback vertex set problems -- Unified approach (Q671377) (← links)
- Approximate solution of NP optimization problems (Q672315) (← links)
- On input read-modes of alternating Turing machines (Q672377) (← links)
- A High-Low Kolmogorov Complexity Law equivalent to the 0-1 Law (Q672725) (← links)
- The class of problems that are linearly equivalent to Satisfiability or a uniform method for proving NP-completeness (Q673091) (← links)
- Local search, reducibility and approximability of NP-optimization problems (Q673464) (← links)
- Alignment of trees -- an alternative to tree edit (Q673642) (← links)
- Complexities of efficient solutions of rectilinear polygon cover problems (Q676264) (← links)
- Primal-dual approximation algorithms for integral flow and multicut in trees (Q679443) (← links)
- Randomized approximation of bounded multicovering problems (Q679446) (← links)
- Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION (Q679447) (← links)
- Greed is good: Approximating independent sets in sparse and bounded-degree graphs (Q679458) (← links)
- A note on the descriptive complexity of maximization problems (Q685495) (← links)
- Structure of polynomial-time approximation (Q692893) (← links)
- Pseudo-Boolean optimization (Q697569) (← links)
- The full Steiner tree problem (Q702772) (← links)
- Minimal multicut and maximal integer multiflow: a survey (Q707131) (← links)
- On the hardness of finding near-optimal multicuts in directed acyclic graphs (Q719273) (← links)
- Clustering with lower-bounded sizes. A general graph-theoretic framework (Q722539) (← links)
- Schedules for marketing products with negative externalities (Q744100) (← links)
- There is no EPTAS for two-dimensional knapsack (Q765522) (← links)
- Completeness in approximation classes (Q811119) (← links)
- Algorithmic aspects of total Roman and total double Roman domination in graphs (Q831689) (← links)
- Hard constraint satisfaction problems have hard gaps at location 1 (Q837178) (← links)
- Complexity issues in color-preserving graph embeddings (Q846361) (← links)
- Approximate \(k\)-Steiner forests via the Lagrangian relaxation technique with internal preprocessing (Q848846) (← links)
- On the longest common rigid subsequence problem (Q848965) (← links)
- Construction algorithms and approximation bounds for the streaming cache placement problem in multicast networks (Q852254) (← links)
- Strong computational lower bounds via parameterized complexity (Q856413) (← links)
- Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization (Q856420) (← links)
- Finding disjoint paths with related path costs (Q857785) (← links)
- Analyzing the complexity of finding good neighborhood functions for local search algorithms (Q857808) (← links)
- A network flow approach to the minimum common integer partition problem (Q861289) (← links)
- Using fractional primal-dual to schedule split intervals with demands (Q865744) (← links)
- Exact algorithms and applications for tree-like Weighted Set Cover (Q866547) (← links)
- Polynomial time approximation schemes and parameterized complexity (Q867860) (← links)
- On the complexity of deriving position specific score matrices from positive and negative sequences (Q876465) (← links)
- The longest common subsequence problem for arc-annotated sequences (Q876717) (← links)
- Differential approximation of MIN SAT, MAX SAT and related problems (Q877035) (← links)
- Power optimization for connectivity problems (Q877193) (← links)
- Computing the minimum number of hybridization events for a consistent evolutionary history (Q881571) (← links)
- Subjective-cost policy routing (Q883998) (← links)
- The multi-multiway cut problem (Q884458) (← links)
