Source: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021)Approximation, Randomization, and Combinatorial Optimization. Algorithms and

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

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي

Academic Journal

Packing Even Directed Circuits Quarter-Integrally

Authors : Maximilian Gorsky; Ken-ichi Kawarabayashi; Stephan Kreutzer

Subjects: FOS: Computer and information sciences; graph structure theory; Discrete Mathematics (cs.DM)

Source: Proceedings of the 56th Annual ACM Symposium on Theory of Computing. :692-703

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

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي

Academic Journal

Formal Probabilistic Methods for Combinatorial Structures using the Lovász Local Lemma

Authors : Edmonds, C; Paulson, LC; Apollo - University of Cambridge Repository

Subjects: FOS: Computer and information sciences; Computer Science - Logic in Computer Science; F.4.1

Source: Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs

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

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي

Academic Journal

Reducing the vertex cover number via edge contractions

Authors : Lima, Paloma T.; dos Santos, Vinicius F.; Sau, Ignasi ...

Subjects: FOS: Computer and information sciences; Combinatorial Optimization and Complexity Theory; 0211 other engineering and technologies

Source: Journal of Computer and System SciencesJournal of Computer and System Sciences, 2023, 136, pp.63-87. ⟨10.1016/j.jcss.2023.03.003⟩MFCS 2022-47th International Symposium on Mathematical

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

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي

Academic Journal

Parameterised temporal exploration problems

Authors : Erlebach, Thomas; Spooner, Jakob T.;

Subjects: FOS: Computer and information sciences; F.2.2; G.2.2

Source: 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022), Virtual Conference, 28-30 March 2022 [Conference proceedings]Journal of Computer and System Sciences, 2023, Vol.135,

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

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي

Academic Journal

Complexity of Efficient Outcomes in Binary-Action Polymatrix Games and Implications for Coordination Problems

Authors : Deligkas, Argyrios; Eiben, Eduard; Gutin, Gregory

Subjects: FOS: Computer and information sciences; F.2.2; G.2.2

Source: Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence. :2642-2650

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

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي

Academic Journal

Approximation Schemes for Capacity Vehicle Routing Problems: A Survey

Authors : Chen, Y.

Subjects: FOS: Computer and information sciences; APPROXIMATION SCHEME; CLASSIFIEDS

Source: 2023 2nd International Conference on Computational Modelling, Simulation and Optimization (ICCMSO)Proceedings-2023 2nd International Conference on Computational Modelling, Simulation and

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

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي

Academic Journal

Reconfiguration of Spanning Trees with Degree Constraints or Diameter Constraints

Authors : Nicolas Bousquet; Takehiro Ito; Yusuke Kobayashi ...

Subjects: FOS: Computer and information sciences; Discrete Mathematics (cs.DM); [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]

Source: AlgorithmicaAlgorithmica, 2023, 85 (9), pp.2779-2816. ⟨10.1007/S00453-023-01117-Z⟩STACSSTACS, Mar 2022, Marseille, France. pp.15:1--15:21, ⟨10.4230/LIPIcs.STACS.2022.15⟩

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

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي