The following pages link to (Q4230322):
Displaying 50 items.
- A note on approximating graph genus (Q290221) (← links)
- Short undeniable signatures based on group homomorphisms (Q451120) (← links)
- Unrelated parallel machine scheduling -- perspectives and progress (Q505093) (← links)
- A survey on tree edit distance and related problems (Q557823) (← 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)
- Local search, reducibility and approximability of NP-optimization problems (Q673464) (← links)
- Alignment of trees -- an alternative to tree edit (Q673642) (← links)
- The relativized relationship between probabilistically checkable debate systems, IP and PSPACE (Q673812) (← 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)
- On approximating the longest path in a graph (Q679451) (← links)
- A series of approximation algorithms for the acyclic directed Steiner tree problem (Q679453) (← 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)
- Approximating the minimum maximal independence number (Q685520) (← links)
- Approximating the tree and tour covers of a graph (Q688437) (← links)
- A well-characterized approximation problem (Q688442) (← links)
- Pseudo-Boolean optimization (Q697569) (← links)
- Minimal multicut and maximal integer multiflow: a survey (Q707131) (← links)
- New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph (Q896848) (← links)
- The Steiner tree problem on graphs: inapproximability results (Q952442) (← links)
- Maximizing business value by optimal assignment of jobs to resources in grid computing (Q958577) (← links)
- The ideal membership problem and polynomial identity testing (Q963063) (← links)
- On approximation algorithms for the terminal Steiner tree problem (Q1029037) (← links)
- An effective local search for the maximum clique problem (Q1041822) (← links)
- APX-hardness of domination problems in circle graphs (Q1045943) (← links)
- Hardness results and spectral techniques for combinatorial problems on circulant graphs (Q1124798) (← links)
- A natural model and a parallel algorithm for approximately solving the maximum weighted independent set problem (Q1129388) (← links)
- Quantifiers and approximation (Q1208413) (← links)
- An algorithm for finding a maximum clique in a graph (Q1267190) (← links)
- An adaptive, multiple restarts neural network algorithm for graph coloring (Q1268156) (← links)
- Hierarchically specified unit disk graphs (Q1269904) (← links)
- A unified approximation algorithm for node-deletion problems (Q1270821) (← links)
- On a scheduling problem of time deteriorating jobs (Q1271170) (← links)
- Alphabet indexing for approximating features of symbols (Q1274598) (← links)
- On the approximation of protein threading (Q1274599) (← links)
- Differential approximation algorithms for some combinatorial optimization problems (Q1274917) (← links)
- On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems (Q1274926) (← links)
- On the hardness of approximating shortest integer relations among rational numbers (Q1274930) (← links)
- Bounding queries in the analytic polynomial-time hierarchy (Q1274987) (← links)
- A new lower bound on approximability of the ground state problem for tridimensional Ising spin glasses (Q1275602) (← links)
- Integer programming as a framework for optimization and approximability (Q1276163) (← links)
- Zero knowledge and the chromatic number (Q1276168) (← links)
- Class Steiner trees and VLSI-design (Q1276969) (← links)
- A generalization of König-Egervary graphs and heuristics for the maximum independent set problem with improved approximation ratios (Q1278660) (← links)
- Computational experience with approximation algorithms for the set covering problem (Q1278941) (← links)
- On the approximability of the Steiner tree problem in phylogeny (Q1281766) (← links)
