Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request
Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request

Purely combinatorial approximation algorithms for maximum k-vertex cover in bipartite graphs

Subjects: Maximum coverage; Maximum cut; Vertex cover

  • Source: Discrete Optimization, 27, 26-56. ElsevierDiscrete OptimizationDiscrete Optimization, Elsevier, 2018, 27, pp.26-56. ⟨10.1016/j.disopt.2017.09.001⟩

تفاصيل العنوان

×
  • 1-10 ل  442 نتائج ل ""Approximation algorithms""