Entity usage

From MaRDI portal

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

List of pages that use a given entity

Showing below up to 41 results in range #1 to #41.

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)

  1. Approximation algorithms for the maximum 2-peripatetic salesman problem: Title
  2. A polynomial algorithm with asymptotic ratio 2/3 for the asymmetric maximization version of the m-PSP: Label: en, Title
  3. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques: Title
  4. A polynomial algorithm with approximation ratio 2/3 for the Asymmetric Maximum 2-Peripatetic Salesman Problem: Title
  5. A polynomial 3/5-approximate algorithm for the asymmetric maximization version of the 3-PSP: Title, Some statements, Miscellaneous (e.g. entity existence), Label: en, Sitelink
  6. Surèna Garmazhapovna Toktokhoeva: Title, Label: en
  7. Bounds for the symmetric 2-peripatetic salesman problem: Title
  8. A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem: Title
  9. Approximation algorithms for solving the 2-peripatetic salesman problem on a complete graph with edge weights 1 and 2: Title
  10. An algorithm with approximation ratio 5/6 for the metric maximum m-PSP: Title
  11. An approximation algorithm for the minimum 2-peripatetic salesman problem with different weight functions: Title
  12. A 4/5 -- approximation algorithm for the maximum traveling salesman problem: Title
  13. Publication:1310005: Title
  14. Publication:499338: Label: en, Title
  15. Person:1750784: Title, Label: en
  16. Lower bounds for symmetricK-peripatetic salesman problems: Title
  17. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques: Title
  18. A polynomial algorithm with approximation ratio 2/3 for the Asymmetric Maximum 2-Peripatetic Salesman Problem: Title
  19. Approximation algorithms for the maximum 2-peripatetic salesman problem: Title
  20. A polynomial algorithm with asymptotic ratio 2/3 for the asymmetric maximization version of the m-PSP: Label: en, Title
  21. A polynomial 3/5-approximate algorithm for the asymmetric maximization version of the 3-PSP: Title, Miscellaneous (e.g. entity existence), Label: en, Some statements, Sitelink
  22. scientific article; zbMATH DE number 2102640: Title
  23. Well-solved cases of the 2-peripatetic salesman problem: Title
  24. Bounds for the symmetric 2-peripatetic salesman problem: Title
  25. scientific article; zbMATH DE number 3485514: Title
  26. scientific article; zbMATH DE number 3910163: Title
  27. A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem: Title
  28. 35/44-Approximation for Asymmetric Maximum TSP with Triangle Inequality: Title
  29. Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs: Title
  30. An algorithm with approximation ratio 5/6 for the metric maximum m-PSP: Title
  31. Approximation algorithms for solving the 2-peripatetic salesman problem on a complete graph with edge weights 1 and 2: Title
  32. scientific article; zbMATH DE number 6004865: Title
  33. A 2-approximation algorithm for the metric 2-peripatetic salesman problem: Title
  34. An approximation algorithm for the minimum 2-peripatetic salesman problem with different weight functions: Title
  35. scientific article; zbMATH DE number 6007907: Title
  36. A 4/5 -- approximation algorithm for the maximum traveling salesman problem: Title
  37. A branch and bound algorithm for symmetric 2-peripatetic salesman problems: Title
  38. 7/5-approximation algorithm for 2-PSP on minimum with different weight functions: Title
  39. Asymptotically optimal algorithm for finding one and two edge-disjoint traveling salesman routes of maximal weight in Euclidean space: Title
  40. On the asymptotic optimality of an algorithm for solving the maximum m-PSP in a multidimensional Euclidean space: Title
  41. Surèna Garmazhapovna Toktokhoeva: Title, Label: en

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)