Výsledky vyhledávání - "approximation polynomial-time algorithm"

An approximation polynomial-time algorithm for a sequence bi-clustering problem

Autoři: Alexander Kel'manov S. A. Khamidullin

Zdroj: Computational Mathematics and Mathematical Physics. 55:1068-1076

Témata: 0301 basic medicine, 0303 health sciences, 03 medical and health sciences, 16. Peace & justice, 6. Clean water

Přístupová URL adresa: http://ui.adsabs.harvard.edu/abs/2015CMMPh..55.1068K/abstract
https://link.springer.com/article/10.1134/S0965542515060068

An approximation polynomial-time algorithm for a cardinality-weighted 2-clustering problem

Autoři: Anna Motkova Alexander Kel'manov

Zdroj: 2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON). :94-96

Témata: 0102 computer and information sciences, 0101 mathematics, 01 natural sciences

Přístupová URL adresa: https://ieeexplore.ieee.org/document/8109845/

An approximation polynomial-time algorithm for a sequence bi-clustering problem.

Autoři: Kel'manov, A. Khamidullin, S.

Zdroj: Computational Mathematics & Mathematical Physics; Jun2015, Vol. 55 Issue 6, p1068-1076, 9p

Témata: APPROXIMATION theory, POLYNOMIAL time algorithms, MATHEMATICAL sequences, FUZZY clustering technique, PROBLEM solving

Rescheduling problems with allowing for the unexpected new jobs arrival.

Autoři: Zhang, Xingong Lin, Win-Chin Wu, Chin-Chia

Zdroj: Journal of Combinatorial Optimization; Apr2022, Vol. 43 Issue 3, p630-645, 16p

An effective approximate algorithm for a general problem of scheduling theory

Autoři: Beletskij, S. A. Levental', V. Ts.

Témata: approximation polynomial-time algorithm, parallel machines at each stage, Numerical mathematical programming methods, minimum length, Deterministic scheduling theory in operations research, Analysis of algorithms and problem complexity, NP-hard, general job shop scheduling

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/3974707

Algorithmic complexity of triple Roman dominating functions on graphs.

Autoři: Poureidi, Abolfazl Fathali, Jafar

Zdroj: Communications in Combinatorics & Optimization. 2024, Vol. 9 Issue 2, p217-232. 16p.

Témata: *DOMINATING set, *GRAPH theory, *BIPARTITE graphs, *APPROXIMATION algorithms, *CONVEX functions

Rescheduling with new orders and general maximum allowable time disruptions.

Autoři: Zhao, Qiulan Lu, Lingfa Yuan, Jinjiang

Zdroj: 4OR (1619-4500); Sep2016, Vol. 14 Issue 3, p261-280, 20p

On Inapproximability of Reconfiguration Problems: PSPACE-Hardness and some Tight NP-Hardness Results

Autoři: S., Karthik C. Manurangsi, Pasin

Témata: Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, text

URL: http://arxiv.org/abs/2312.17140

Rescheduling problems with allowing for the unexpected new jobs arrival

Autoři: Xingong Zhang Win-Chin Lin Chin-Chia Wu

Zdroj: Journal of Combinatorial Optimization. 43:630-645

Témata: 0209 industrial biotechnology, 8. Economic growth, 0211 other engineering and technologies, 02 engineering and technology

Přístupová URL adresa: https://link.springer.com/article/10.1007%2Fs10878-021-00803-4

A Push-Relabel Algorithm for Approximating Degree Bounded MSTs.

Autoři: Chaudhuri, Kamalika Rao, Satish Riesenfeld, Samantha a další

Zdroj: Automata, Languages & Programming (9783540359043); 2006, p191-201, 11p

Vertex cover number in diverse graph architectures.

Autoři: J., Anitha Rajasingh, Indra Rajan, R. Sundara a další

Zdroj: RAIRO: Operations Research (2804-7303); 2025, Vol. 59 Issue 1, p397-408, 12p

Témata: HONEYCOMB structures, TORUS, HYPERGRAPHS

Optimization problems with uncertain objective coefficients using capacities.

Autoři: Vu, Tuan-Anh Afifi, Sohaib Lefèvre, Eric a další

Zdroj: Annals of Operations Research; Jan2025, Vol. 344 Issue 1, p383-412, 30p

Témata: MULTI-objective optimization, POLYNOMIAL time algorithms, GREEDY algorithms, COMBINATORIAL optimization, DECISION making

Polylogarithmic approximation for Euler genus on bounded degree graphs

Autoři: Anastasios Sidiropoulos Ken-ichi Kawarabayashi

Zdroj: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing. :164-175

Témata: 0102 computer and information sciences, 01 natural sciences

Přístupová URL adresa: https://dl.acm.org/doi/pdf/10.1145/3313276.3316409

APPROXIMATING WIDTH PARAMETERS OF HYPERGRAPHS WITH EXCLUDED MINORS.

Autoři: Fomin, Fedor V. Golovach, Petr A. Thilikos, Dimitrios M.

Zdroj: SIAM Journal on Discrete Mathematics; 2011, Vol. 25 Issue 3/4, p1331-1348, 18p, 5 Diagrams

Témata: HYPERGRAPHS, DATABASES, ARTIFICIAL intelligence, BOOLEAN functions, ALGORITHMS, POLYNOMIALS

EFFICIENT APPROXIMATION ALGORITHMS FOR PAIRWISE DATA CLUSTERING AND APPLICATIONS.

Autoři: Wu, Xiaodong Chen, Danny Z. Mason, James J. a další

Zdroj: International Journal of Computational Geometry & Applications. Apr2004, Vol. 14 Issue 1/2, p85-104. 20p.

Témata: *ALGORITHMS, *TRIANGLES, *PLANE geometry, *POLYNOMIALS, *EUCLIDEAN algorithm, *MATHEMATICAL programming

Finding Short Synchronizing Words for Prefix Codes

Autoři: Ryzhikov, Andrew Szykula, Marek

Témata: synchronizing word, mortal word, avoiding word, Huffman decoder, inapproximability, Data processing Computer science, InProceedings, publishedVersion

A theoretical and empirical study of job scheduling in cloud computing environments: the weighted completion time minimization problem with capacitated parallel machines.

Autoři: Cohen, Ilan Reuven Cohen, Izack Zaks, Iyar

Zdroj: Annals of Operations Research; Jul2024, Vol. 338 Issue 1, p429-452, 24p

Témata: CLOUD computing, POLYNOMIAL time algorithms, APPROXIMATION algorithms, EMPIRICAL research, MACHINERY, ECONOMIC lot size

Rescheduling with new orders and general maximum allowable time disruptions

Autoři: Jinjiang Yuan Lingfa Lu Qiulan Zhao

Zdroj: 4OR. 14:261-280

Témata: 0211 other engineering and technologies, 02 engineering and technology, 10. No inequality, 16. Peace & justice

Přístupová URL adresa: https://link.springer.com/content/pdf/10.1007%2Fs10288-016-0308-0.pdf
https://link.springer.com/article/10.1007/s10288-016-0308-0/fulltext.html
https://link.springer.com/article/10.1007/s10288-016-0308-0
https://dblp.uni-trier.de/db/journals/4or/4or14.html#ZhaoLY16

Bounds and Heuristics for Multiproduct Pricing.

Autoři: Gallego, Guillermo Berbeglia, Gerardo

Zdroj: Management Science; Jun2024, Vol. 70 Issue 6, p4132-4144, 13p

Témata: PRICES, INDUSTRIAL clusters, K-means clustering, HEURISTIC, SURETYSHIP & guaranty

Geografický termín: HONG Kong (China)

Asymptotically Optimal Approximation Algorithms for Coflow Scheduling

Autoři: Jahanjou, Hamidreza Kantor, Erez Rajaraman, Rajmohan

Témata: Computer Science - Distributed, Parallel, and Cluster Computing, Computer Science - Data Structures and Algorithms, text

URL: http://arxiv.org/abs/1606.06183