New Results on Polynomial Inapproximabilityand Fixed Parameter Approximability of Edge Dominating Set.
- Published in:
- Theory of Computing Systems, 2015, v. 56, n. 2, p. 330, doi. 10.1007/s00224-014-9549-5
- By:
- Publication type:
- Article
Works matching IS 14324350 AND DT 2015 AND VI 56 AND IP 2
Results: 8
1
2
Hardness of Approximation for Knapsack Problems.
- Published in:
- Theory of Computing Systems, 2015, v. 56, n. 2, p. 372, doi. 10.1007/s00224-014-9550-z
- By:
- Publication type:
- Article
3
Topological Approach to Multivalued Information System.
- Published in:
- Theory of Computing Systems, 2015, v. 56, n. 2, p. 406, doi. 10.1007/s00224-014-9551-y
- By:
- Publication type:
- Article
4
Rent or Buy Problems with a Fixed Time Horizon.
- Published in:
- Theory of Computing Systems, 2015, v. 56, n. 2, p. 309, doi. 10.1007/s00224-014-9552-x
- By:
- Publication type:
- Article
5
Estimating the Volume of Solution Space for Satisfiability Modulo Linear Real Arithmetic.
- Published in:
- Theory of Computing Systems, 2015, v. 56, n. 2, p. 347, doi. 10.1007/s00224-014-9553-9
- By:
- Publication type:
- Article
6
Sitting Closer to Friends than Enemies, Revisited.
- Published in:
- Theory of Computing Systems, 2015, v. 56, n. 2, p. 394, doi. 10.1007/s00224-014-9558-4
- By:
- Publication type:
- Article
7
Generalized River Crossing Problems.
- Published in:
- Theory of Computing Systems, 2015, v. 56, n. 2, p. 418, doi. 10.1007/s00224-014-9562-8
- By:
- Publication type:
- Article
8
On the Turing Completeness of the Semantic Web.
- Published in:
- Theory of Computing Systems, 2015, v. 56, n. 2, p. 291, doi. 10.1007/s00224-014-9536-x
- By:
- Publication type:
- Article