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

Polynomial-Time Algorithms for Fair Orientations of Chores

Autoři: Hsu, Kevin King, Valerie

Zdroj: ECAI 2025. 413

Approximation Polynomial-Time Algorithms for Consistency-Aware Multi-Server Network Design in Delay-Sensitive Applications

Autoři: Masaki Oda Akio Kawabata Eiji Oki

Zdroj: IEEE Networking Letters. 7:135-139

On a Class of Interdiction Problems with Partition Matroids: Complexity and Polynomial-Time Algorithms

Autoři: Sergey S. Ketkov Oleg A. Prokopyev

Zdroj: INFORMS Journal on Computing.

Témata: FOS: Computer and information sciences, Computational Complexity, Optimization and Control (math.OC), Optimization and Control, 0211 other engineering and technologies, FOS: Mathematics, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 01 natural sciences

Přístupová URL adresa: http://arxiv.org/abs/2401.12010

An Experimental Study of Polynomial Time Algorithms for Minimum 2-Edge Connected Subgraph Problem

Autoři: Nour Alkinj

Zdroj: International Journal of Computer Science and Mobile Computing. 13:38-44

Efficient Statistics With Unknown Truncation, Polynomial Time Algorithms, Beyond Gaussians

Autoři: Lee, Jane H. Mehrotra, Anay Zampetakis, Manolis

Zdroj: 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS). :988-1006

Témata: FOS: Computer and information sciences, Computer Science - Machine Learning, Statistics - Machine Learning, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Mathematics - Statistics Theory, Data Structures and Algorithms (cs.DS), Machine Learning (stat.ML), Statistics Theory (math.ST), Statistics - Computation, Computation (stat.CO), Machine Learning (cs.LG)

Přístupová URL adresa: http://arxiv.org/abs/2410.01656

Polynomial-Time Algorithms for Contiguous Art Gallery and Related Problems

Autoři: Biniaz, Ahmad Maheshwari, Anil Merrild, Magnus Christian Ring a další

Přispěvatelé: Biniaz, Ahmad Maheshwari, Anil Merrild, Magnus Christian Ring a další

Zdroj: Biniaz, A, Maheshwari, A, Merrild, M C R, Mitchell, J S B, Odak, S, Polishchuk, V, Robson, E W, Rysgaard, C M, Schou, J K R, Shermer, T, Spalding-Jamieson, J, Svenning, R & Zheng, D W 2025, Polynomial-Time Algorithms for Contiguous Art Gallery and Related Problems. in O Aichholzer & H Wang (eds), 41st International Symposium on Computational Geometry, SoCG 2025. Schloss Dagstuhl-Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Dagstuhl, Leibniz International Proceedings in Informatics, LIPIcs, vol. 332, pp. 20:1-20:21, 41st International Symposium on Computational Geometry, SoCG 2025, Kanazawa, Japan, 23/06/2025. https://doi.org/10.4230/LIPIcs.SoCG.2025.20

Témata: Combinatorics, Art Gallery Problem, Computational Geometry, Discrete Algorithms, ddc:004

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.20
https://pure.au.dk/portal/en/publications/4db9e00b-3871-4478-92bd-1cf417713727
https://doi.org/10.4230/LIPIcs.SoCG.2025.20
http://www.scopus.com/inward/record.url?scp=105009601463&partnerID=8YFLogxK

Polynomial-Time Algorithms for Path Cover on Trees and Graphs of Bounded Treewidth

Autoři: Foucaud, Florent Majumder, Atrayee Mömke, Tobias a další

Přispěvatelé: Foucaud, Florent Majumder, Atrayee Mömke, Tobias a další

Zdroj: Lecture Notes in Computer Science ISBN: 9783031834370

Témata: Treewidth, Path Cover, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], Trees

Popis souboru: application/pdf

Přístupová URL adresa: https://hal.science/hal-04931788v1
https://doi.org/10.1007/978-3-031-83438-7_13
https://hal.science/hal-04931788v1/document

Polynomial Time Algorithms for Hop Domination

Autoři: D. Karthika R. Muthucumaraswamy Sriram Bhyravarapu a další

Zdroj: Lecture Notes in Computer Science ISBN: 9783031834370

Minimal Control Nodes for Strong Structural Observability of Discrete-Time Iterative Systems: Explicit Formulas and Polynomial-Time Algorithms

Autoři: Shiyong Zhu Jianquan Lu Daniel W.C. Ho a další

Zdroj: IEEE Transactions on Automatic Control. 69:2158-2173

Polynomial-time algorithms in algebraic number theory

Autoři: van Gent, Daniël M. H.

Témata: Mathematics - Number Theory, FOS: Mathematics, Number Theory (math.NT), 11Y16

Přístupová URL adresa: http://arxiv.org/abs/2502.19036

Polynomial-Time Algorithms for Semiprime Factorization

Autoři: Fabiano Ferreira da Silva

Polynomial-Time Algorithms for Black-Box Distributive Expanded Groups

Autoři: Anokhin, Mikhail

Témata: Computer Science - Symbolic Computation, FOS: Computer and information sciences, Computer Science - Computational Complexity, 68W30 (primary), 68Q09, 08A62 (secondary), Rings and Algebras (math.RA), FOS: Mathematics, Mathematics - Rings and Algebras, Computational Complexity (cs.CC), Symbolic Computation (cs.SC)

Přístupová URL adresa: http://arxiv.org/abs/2505.20497

Polynomial time algorithms for the token swapping problem on cographs

Autoři: Caio Henrique Segawa Tonetti Vinicius Fernandes dos Santos Sebastián Urrutia

Zdroj: RAIRO - Operations Research. 58:441-455

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

Necessary conditions for graph isomorphism problem: polynomial time algorithms

Autoři: Garimella, R.

Zdroj: Stochastic Modeling and Applied Research of Technology. :36-44

Témata: Graph Theory, Symmetric matrix, Spectral Graph Theory, Isomorphism, Edge connectivity

Approximation Polynomial-Time Algorithms for Consistency-Aware Multi-Server Network Design in Delay-Sensitive Applications

Autoři: 70524156 Oda, Masaki Kawabata, Akio a další

Témata: Server allocation, approximation algorithm, data consistency, journal article

URL: http://hdl.handle.net/2433/295071
http://xplorestaging.ieee.org/ielx8/8253410/11038953/10883039.pdf?arnumber=10883039
10.1109/lnet.2025.3541351
http://xplorestaging.ieee.org/ielx8/8253410/11038953/10883039.pdf?arnumber=10883039

Approximation Polynomial-Time Algorithms for Consistency-Aware Multi-Server Network Design in Delay-Sensitive Applications.

Autoři: Kawabata, Akio Oki, Eiji Oda, Masaki

Témata: Server allocation, approximation algorithm, data consistency, Journal Article., VoR.

URL: http://hdl.handle.net/2433/295071
https://doi.org/10.1109/lnet.2025.3541351
http://repository.kulib.kyoto-u.ac.jp/dspace/bitstream/2433/295071/1/lnet2025.3541351.pdf

Polynomial-Time Algorithms for Continuous Metrics on Atomic Clouds of Unordered Points

Autoři: Kurlin, Vitaliy

Zdroj: Match - Communications in Mathematical and in Computer Chemistry. 91:79-108

Témata: Computational Geometry (cs.CG), FOS: Computer and information sciences, 0202 electrical engineering, electronic engineering, information engineering, Computer Science - Computational Geometry, 51F20, 51N20, 51K05, 0102 computer and information sciences, 02 engineering and technology, 0101 mathematics, 01 natural sciences

Přístupová URL adresa: http://arxiv.org/abs/2207.08502

Polynomial-time algorithms for deterministic uncapacitated lot-sizing problem with heterogeneous production cycles

Autoři: Tan Yu Xiang Zhong Yongpei Guan

Zdroj: Operations Research Letters. 61:107304

Polynomial Time Algorithms to Minimize Total Travel Time in a Two-Depot Automated Storage/Retrieval System

Autoři: Gharehgozli, Amir Hossein Yu, Yugang Zhang, Xiandong a další

Zdroj: Transportation Science, 2017 Feb 01. 51(1), 19-33.

Přístupová URL adresa: http://www.jstor.org/stable/44282401

Flow-augmentation I: Directed graphs.

Autoři: Kim, Eun Jung Kratsch, Stefan Pilipczuk, Marcin a další

Zdroj: Journal of the ACM. Feb2025, Vol. 72 Issue 1, p1-38. 38p.

Témata: POLYNOMIAL time algorithms, GRAPH algorithms, CUTTING stock problem, INTEGERS, LOGICAL prediction, DIRECTED graphs