Výsledky vyhľadávania - "polynomial time \(\rho\)-approximation algorithm"

The Approximability Behaviour of Some Combinatorial Problems with Respect to the Approximability of a Class of Maximum Independent Set Problems: The approximability behaviour of some combinatorial problems with respect to the approximability of a class of maximum independent set problems

Autori: Demange, Marc Paschos, Vangelis Université Paris 1 a ďalší

Prispievatelia: Demange, Marc Paschos, Vangelis Université Paris 1 a ďalší

Zdroj: Computational Optimization and Applications. 7:307-324

Predmety: Convex programming, Combinatorial optimization, polynomial time approximation algorithm, 0211 other engineering and technologies, quadratic programming, 02 engineering and technology, Programming involving graphs or networks, Quadratic programming, independent set, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), NP-complete problem, vertex covering, quadratic programming as subproblem, polynomial time \(\rho\)-approximation algorithm, Abstract computational complexity for mathematical programming problems, Recherche opérationnelle

Popis súboru: application/xml

Prístupová URL adresa: https://basepub.dauphine.fr/handle/123456789/2774
https://rd.springer.com/article/10.1023/A%3A1008660812834
https://dblp.uni-trier.de/db/journals/coap/coap7.html#DemangeP97
https://link.springer.com/article/10.1023%2FA%3A1008660812834

Extended Matching Problem for a Coupled-Tasks Scheduling Problem

Autori: Simonin, Gilles Giroudeau, Rodolphe König, Jean-Claude a ďalší

Prispievatelia: Simonin, Gilles Giroudeau, Rodolphe König, Jean-Claude a ďalší

Zdroj: TMFCS'09: International Conference on Theoretical and Mathematical Foundations of Computer Science ; https://hal-lirmm.ccsd.cnrs.fr/lirmm-00375000 ; TMFCS'09: International Conference on Theoretical and Mathematical Foundations of Computer Science, Jul 2009, Orlando, Florida, United States. pp.082-089

Predmety: [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC], [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]

Geografické téma: Orlando, Florida, United States

Dostupnosť: https://hal-lirmm.ccsd.cnrs.fr/lirmm-00375000
https://hal-lirmm.ccsd.cnrs.fr/lirmm-00375000v1/document
https://hal-lirmm.ccsd.cnrs.fr/lirmm-00375000v1/file/2-recouvrementRR.pdf

On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications

Autori: Evripidis Bampis Rodolphe Giroudeau Jean-Claude König

Zdroj: RAIRO - Operations Research. 36:21-36

Predmety: Deterministic scheduling theory in operations research, 0211 other engineering and technologies, scheduling, 02 engineering and technology, hierarchical communications, non-approximability

Popis súboru: application/xml

Prístupová URL adresa: http://www.numdam.org/item/10.1051/ro:2002003.pdf
https://zbmath.org/1810531
https://doi.org/10.1051/ro:2002003
https://dblp.uni-trier.de/db/journals/rairo/rairo36.html#BampisGK02
http://archive.numdam.org/ARCHIVE/RO/RO_2002__36_1/RO_2002__36_1_21_0/RO_2002__36_1_21_0.pdf
http://www.numdam.org/item/?id=RO_2002__36_1_21_0
https://www.rairo-ro.org/articles/ro/abs/2002/01/ro99116/ro99116.html
https://www.cambridge.org/core/journals/rairo-operations-research/article/on-the-hardness-of-approximating-the-uetuct-scheduling-problem-with-hierarchical-communications/1A3607D4148F3679BEAC0EC055234413
https://hal-lirmm.ccsd.cnrs.fr/lirmm-00268637

Open block scheduling in optical communication networks

Autori: Kononov, A Kononov, AV 管理學院:資訊管理學系 a ďalší

Prispievatelia: Kononov, A Kononov, AV 管理學院:資訊管理學系 a ďalší

Predmety: None

Relation: APPROXIMATION AND ONLINE ALGORITHMS, 2909: 13-26 2004; http://ir.ncnu.edu.tw:8080/handle/310010000/14726

Dostupnosť: http://ir.ncnu.edu.tw:8080/handle/310010000/14726