نتائج البحث

Approximation Algorithms for the Vertex K-Center Problem: Survey and Experimental Evaluation

• Authors : Jesus Garcia-Diaz; N. Lakouari; Saul E. Pomares Hernandez

Subjects: Discrete mathematics; polynomial time heuristics; 021103 operations research

• Source: IEEE Access, Vol 7, Pp 109228-109245 (2019)

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

Faster approximation algorithms for computing shortest cycles on weighted graphs

• Authors : Guillaume Ducoffe;

Subjects: Discrete mathematics; FOS: Computer and information sciences; [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]

• Source: 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)46th International Colloquium on Automata, Languages, and Programming (ICALP 2019), Jul 2019, Patras, Greece.

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

Exact and superpolynomial approximation algorithms for the densest k-subgraph problem

• Authors : Giorgio Lucarelli; Ioannis Milis; Aristotelis Giannakos ...

Subjects: Information Systems and Management; Optimization problem; General Computer Science

• Source: European Journal of Operational ResearchEuropean Journal of Operational Research, Elsevier, 2017, 262, pp.894-903. ⟨10.1016/j.ejor.2017.04.034⟩European Journal of Operational Research,

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

Approximation Algorithms for Connected Graph Factors of Minimum Weight

• Authors : Bodo Manthey; Kamiel Cornelissen; Ruben Hoeksma ...

Subjects: Discrete mathematics; Degree (graph theory); 010102 general mathematics

• Source: Theory of computing systems, 62(2), 441-464. Springer

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

Approximation Algorithms for Packing Element-Disjoint Steiner Trees on Bounded Terminal Nodes

• Authors : Eiji Miyano; Daiki Hoshika

Subjects: Discrete mathematics; Applied Mathematics; Approximation algorithm

• Source: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. :1059-1066

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

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

• Authors : Georgios Stamoulis; Édouard Bonnet; Bruno Escoffier ...

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⟩

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

Sublinear-Space Approximation Algorithms for Max r-SAT

• Authors : Venkatesh Raman; Arindam Biswas

Subjects: Discrete mathematics; TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES; Sublinear function

• Source: Lecture Notes in Computer Science ISBN: 9783030895426COCOON

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

Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization

• Authors : Sounaka Mishra; Saket Saurabh; N. Safina Devi

Subjects: Vertex (graph theory); Discrete mathematics; General Computer Science

• Source: Theoretical Computer Science

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

Approximation Algorithms for Multiple Sequence Alignment under a Fixed Evolutionary Tree

• Authors : R. Ravi; John Kececioglu

Subjects: Discrete mathematics; 150399 Business and Management not elsewhere classified; K-ary tree

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

Approximation Algorithms for Stochastic Minimum-Norm Combinatorial Optimization

• Authors : Chaitanya Swamy; Sharat Ibrahimpur

Subjects: Discrete mathematics; 021103 operations research; Spanning tree

• Source: FOCS

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