Výsledky vyhledávání - analysis of algorithms and problems complexity*

Stable Approximation Algorithms for Dominating Set and Independent Set: Stable approximation algorithms for dominating set and independent set

Autoři: Mark de Berg Arpan Sadhukhan Frits Spieksma a další

Přispěvatelé: Mark de Berg Arpan Sadhukhan Frits Spieksma a další

Zdroj: SIAM Journal on Discrete Mathematics. 39:921-945

Témata: FOS: Computer and information sciences, dynamic algorithms, Discrete Mathematics (cs.DM), Analysis of algorithms and problem complexity, General topics of discrete mathematics in relation to computer science, dominating set, stability, Approximation algorithms, bounded recourse, independent set, Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), Graph algorithms (graph-theoretic aspects), Computer Science - Data Structures and Algorithms, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), ddc:004, approximation algorithms, Dynamic algorithms, Computer Science - Discrete Mathematics

Popis souboru: application/xml; application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2412.13358
https://zbmath.org/8037180
https://doi.org/10.1137/24m1644079
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.27

Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem: Stable approximation algorithms for the dynamic broadcast range-assignment problem

Autoři: Mark de Berg Arpan Sadhukhan Frits Spieksma a další

Přispěvatelé: Mark de Berg Arpan Sadhukhan Frits Spieksma a další

Zdroj: SIAM Journal on Discrete Mathematics. 38:790-827

Témata: Computational Geometry (cs.CG), FOS: Computer and information sciences, broadcast range assignment, online algorithms, stable approximation schemes, Analysis of algorithms and problem complexity, Discrete geometry, General topics of discrete mathematics in relation to computer science, 0102 computer and information sciences, 68W27, 68Q25, 01 natural sciences, Computational geometry, bounded recourse, F.2.2, F.2.3, Computer graphics, computational geometry (digital and algorithmic aspects), Computer Science - Data Structures and Algorithms, computational geometry, Computer Science - Computational Geometry, Data Structures and Algorithms (cs.DS), ddc:004, broadcast range assignement

Popis souboru: application/xml; application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2112.05426
https://research.tue.nl/en/publications/e5bf163d-884a-4515-8198-681071448b9c
https://doi.org/10.4230/LIPIcs.SWAT.2022.15
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2022.15

A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints

Autoři: Kameng Nip Zhenbo Wang

Zdroj: Journal of Scheduling. 26:543-558

Témata: 8. Economic growth, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Přístupová URL adresa: https://link.springer.com/article/10.1007/s10951-021-00677-8

Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms: Selected multicriteria shortest path problems: an analysis of complexity, models and adaptation of standard algorithms

Autoři: Tarapata, Zbigniew Korbicz, Józef (1951- ) - red.

Přispěvatelé: Tarapata, Zbigniew Korbicz, Józef (1951- ) - red.

Zdroj: International Journal of Applied Mathematics and Computer Science. 17:269-287

Témata: terrain-based, Analysis of algorithms and problem complexity, 0211 other engineering and technologies, Stochastic programming, Automated systems (robots, etc.) in control theory, 02 engineering and technology, terrain-based modeling, Applications of mathematical programming, Mathematical modelling of systems, multiobjective shortest path, stochastic shortest path, algorithm complexity, 0202 electrical engineering, electronic engineering, information engineering, Stochastic systems in control theory (general), routing problem, approximation algorithm

Popis souboru: application/xml

Přístupová URL adresa: https://content.sciendo.com/downloadpdf/journals/amcs/17/2/article-p269.pdf
https://zbc.uz.zgora.pl/Content/9346/11tarapata.pdf
http://pldml.icm.edu.pl/pldml/element/bwmeta1.element.bwnjournal-article-amcv17i2p269bwm
http://matwbn.icm.edu.pl/ksiazki/amc/amc17/amc17211.pdf
http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.baztech-article-BPZ1-0041-0029
https://sciendo.com/article/10.2478/v10006-007-0023-2
https://sciendo.com/pdf/10.2478/v10006-007-0023-2

The algorithm and complexity of co-secure domination in geometric intersection graphs

Autoři: Wang, Cai-Xia Yang, Yu Xu, Shou-Jun

Zdroj: Computational and Applied Mathematics. 44

Témata: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), co-secure domination, Analysis of algorithms and problem complexity, geometric intersection graphs, APX-hard, approximation algorithm, NP-complete

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/7959238
https://doi.org/10.1007/s40314-024-02982-2

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

Interpolation Conditions for Linear Operators and Applications to Performance Estimation Problems: Interpolation conditions for linear operators and applications to performance estimation problems

Autoři: Nizar Bousselmi Julien M. Hendrickx François Glineur a další

Přispěvatelé: Nizar Bousselmi Julien M. Hendrickx François Glineur a další

Zdroj: SIAM Journal on Optimization, Vol. 34, no.3, p. 3033-3063 (2024)

Témata: Convex programming, Analysis of algorithms and problem complexity, exact convergence rates, interpolation conditions, 0211 other engineering and technologies, 02 engineering and technology, Quadratic programming, performance estimation, Numerical methods involving duality, primal-dual algorithms, first-order algorithms, linear operators, Optimization and Control (math.OC), FOS: Mathematics, Semidefinite programming, 90C25, 90C20, 68Q25, 90C22, 49M29, quadratic functions, Mathematics - Optimization and Control

Popis souboru: application/xml

Přístupová URL adresa: http://arxiv.org/abs/2302.08781
https://zbmath.org/7909893
https://doi.org/10.1137/23m1575391
https://hdl.handle.net/2078.1/293045

Enumerating Minimal Connected Dominating Sets: Enumerating minimal connected dominating sets

Autoři: Faisal Abu-Khzam Henning Fernau Benjamin Gras a další

Přispěvatelé: Faisal Abu-Khzam Henning Fernau Benjamin Gras a další

Zdroj: SIAM Journal on Discrete Mathematics. 39:946-972

Témata: connected domination, Connectivity, Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), enumeration problems, degenerate graphs, Graph algorithms (graph-theoretic aspects), Analysis of algorithms and problem complexity, Graph theory (including graph drawing) in computer science, Analysis of algorithms, ddc:004, Enumeration in graph theory, Nonnumerical algorithms

Popis souboru: application/xml; application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.1

Unary NP-hardness of transportation and batching scheduling to minimize the total weighted completion time

Autoři: Wei, Hongjun Gao, Yuan Yuan, Jinjiang

Zdroj: Discrete Applied Mathematics. 369:45-52

Témata: transportation, Transportation, logistics and supply chain management, total weighted completion time, Deterministic scheduling theory in operations research, Analysis of algorithms and problem complexity, batching scheduling, unary NP-hard

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/8028611
https://doi.org/10.1016/j.dam.2025.02.023

Beyond Complexity: An Experimental Study of Maximum Flow Algorithms

Autoři: Borralho, Rafael Tavares Mamede, Margarida RUN

Přispěvatelé: Borralho, Rafael Tavares Mamede, Margarida RUN

Témata: Maximum flow, Algorithms, Time complexity, Experimental analysis, Comparative analysis, Domínio/Área Científica::Engenharia e Tecnologia::Engenharia Eletrotécnica, Eletrónica e Informática

Popis souboru: application/pdf

Dostupnost: http://hdl.handle.net/10362/178443

HODLR3D: hierarchical matrices for N-body problems in three dimensions: HODLR3D: hierarchical matrices for \(N\)-body problems in three dimensions

Autoři: Kandappan, V. A. Gujjula, Vaishnavi Ambikasaran, Sivaram

Zdroj: Numerical Algorithms. 97:1635-1672

Témata: hierarchical matrices, 68Q25, 68R10, 68U05, 45B05, 68U20, \(N\)-body problems, HODLR, Analysis of algorithms and problem complexity, Graph theory (including graph drawing) in computer science, Computer graphics, computational geometry (digital and algorithmic aspects), FOS: Mathematics, Fredholm integral equations, Mathematics - Numerical Analysis, Numerical Analysis (math.NA), Simulation

Popis souboru: application/xml

Přístupová URL adresa: http://arxiv.org/abs/2307.16303
https://zbmath.org/7958575
https://doi.org/10.1007/s11075-024-01765-4

Mixed Precision HODLR Matrices: Mixed precision HODLR matrices

Autoři: Erin Carson Xinye Chen Xiaobo Liu a další

Přispěvatelé: Erin Carson Xinye Chen Xiaobo Liu a další

Zdroj: SIAM Journal on Scientific Computing. 47:A1408-A1435

Témata: hierarchical matrices, Hierarchical matrices, 65D18, Roundoff error, mixed precision computing, Analysis of algorithms and problem complexity, 65G50, 65F55, 68Q25, 65D18, 68Q25, Numerical methods for low-rank matrix approximation, matrix compression, matrix computations AMS subject classifications. 65G50, Numerical Analysis (math.NA), [INFO] Computer Science [cs], Hierarchical matrices mixed precision computing matrix computations AMS subject classifications. 65G50 65F55 68Q25 65D18, Numerical aspects of computer graphics, image analysis, and computational geometry, FOS: Mathematics, Mathematics - Numerical Analysis, matrix computations, 65F55

Popis souboru: application/xml; application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2407.21637
https://hal.science/hal-05066310v1
https://doi.org/10.1137/24m1683925
https://hal.science/hal-05066310v1/document

Algorithms and complexity analysis for some flow problems

Autoři: Nimrod Megiddo Edith Cohen

Zdroj: Algorithmica. 11:320-340

Témata: strongly polynomial, linear- programming, Analysis of algorithms and problem complexity, Graph theory (including graph drawing) in computer science, Linear programming, constrained flow, parametric flow, Programming involving graphs or networks

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/529945
https://doi.org/10.1007/bf01240739
https://dblp.uni-trier.de/db/journals/algorithmica/algorithmica11.html#CohenM94
https://link.springer.com/article/10.1007/BF01240739
https://dl.acm.org/doi/10.5555/127787.127814
https://link.springer.com/article/10.1007/BF01240739
https://dblp.uni-trier.de/db/conf/soda/soda91.html#CohenM91

Small Vertex Cover Helps in Fixed-Parameter Tractability of Graph Deletion Problems over Data Streams: Small vertex cover helps in fixed-parameter tractability of graph deletion problems over data streams

Autoři: Arijit Bishnu Arijit Ghosh Sudeshna Kolay a další

Zdroj: Theory of Computing Systems. 67:1241-1267

Témata: streaming algorithms, Analysis of algorithms and problem complexity, FPT, Combinatorial Optimization and Complexity Theory, Constraint Satisfaction Problems, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Algorithmic Applications, 7. Clean energy, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Graph algorithms (graph-theoretic aspects), minor deletion problems, 0202 electrical engineering, electronic engineering, information engineering, Nonnumerical algorithms, Graph Algorithms, Computer science, vertex cover, subgraph deletion problems, Algorithm, Parameterized complexity, Computational Theory and Mathematics, Graph theory (including graph drawing) in computer science, Fixed-Parameter Algorithms, Computer Science, Physical Sciences, Graph Theory and Algorithms, Parameterized Complexity

Popis souboru: application/xml

Safety in Multi-Assembly via Paths Appearing in All Path Covers of a DAG

Autoři: Cáceres, Manuel Mumey, Brendan Husić, Edin a další

Zdroj: IEEE/ACM Transactions on Computational Biology & Bioinformatics. 19(6):3673-3684

Témata: Graph algorithms, Network problems, Analysis of Algorithms and Problem Complexity, Biology and genetics, datalogi, Computer Science

Popis souboru: print

Přístupová URL adresa: https://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-199751
https://doi.org/10.1109/tcbb.2021.3131203

Decomposition of the option pricing formula for infinite activity jump-diffusion stochastic volatility models

Autoři: Youssef El-Khatib Zororo S. Makumbe Josep Vives

Zdroj: Mathematics and Computers in Simulation. 231:276-293

Témata: option price decomposition, Lévy processes, Analysis of algorithms and problem complexity, Graph theory (including graph drawing) in computer science, variance gamma, Computer graphics, computational geometry (digital and algorithmic aspects), tempered stable, stochastic volatility

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/8031680
https://doi.org/10.1016/j.matcom.2024.12.010

Matchings, Relaxed Popularity, and Optimality: Matchings, relaxed popularity, and optimality

Autoři: Kavitha, Telikepalli

Zdroj: SIAM Journal on Discrete Mathematics. 39:881-911

Témata: Combinatorial optimization, Matching models, stable matchings, bipartite graphs, mixed matchings, Analysis of algorithms and problem complexity, dual certificates

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/8037178
https://doi.org/10.1137/24m163596x

Instantaneous Frequency and Amplitude Estimation in Multicomponent Signals Using an EM-Based Algorithm

Autoři: Quentin Legros Dominique Fourer Sylvain Meignen a další

Přispěvatelé: Quentin Legros Dominique Fourer Sylvain Meignen a další

Zdroj: IEEE Transactions on Signal Processing. 72:1130-1140

Témata: Blind Source Separation and Independent Component Analysis, Artificial intelligence, Machine Fault Diagnosis and Prognostics, synthesis, ACM: H.: Information Systems/H.5: INFORMATION INTERFACES AND PRESENTATION (e.g, ACM: I.: Computing Methodologies/I.5: PATTERN RECOGNITION/I.5.4: Applications/I.5.4.1: Signal processing, Component (thermodynamics), Amplitude, Engineering, [INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing, ridge extraction, Expectation–maximization algorithm, Speech Enhancement Techniques, Spectrogram, Estimation theory, Physics, Monte Carlo sampling, Mathematical optimization, Statistics, Programming language, Algorithm, SIGNAL (programming language), Physical Sciences, Telecommunications, Thermodynamics, Empirical Mode Decomposition, Signal processing, [INFO.INFO-TS] Computer Science [cs]/Signal and Image Processing, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.1: Numerical Algorithms and Problems/F.2.1.0: Computation of transforms (e.g, and processing, Instantaneous phase, Noise (video), Speech recognition, time-frequency, Quantum mechanics, ACM: G.: Mathematics of Computing, JEL: C - Mathematical and Quantitative Methods/C.C6 - Mathematical Methods • Programming Models • Mathematical and Simulation Modeling/C.C6.C63 - Computational Techniques • Simulation Modeling, FOS: Mathematics, Image (mathematics), Radar, fast Fourier transform), Bayesian estimation, Time–frequency analysis, Computer science, Control and Systems Engineering, Signal Processing, Computer Science, Maximization, Expectation-Maximization algorithm, HCI)/H.5.5: Sound and Music Computing/H.5.5.2: Signal analysis, Mathematics, Maximum likelihood

Popis souboru: application/pdf

Přístupová URL adresa: https://hal.science/hal-04436653v1/document
https://hal.science/hal-04436653v1
https://doi.org/10.1109/tsp.2024.3361713

Complexity analysis and algorithms for the Inter Cell Interference Coordination with fixed transmit powers problem

Autoři: Gaurav S. Kasbekar Ashwathi Nambiar

Zdroj: 2015 7th International Conference on Communication Systems and Networks (COMSNETS). :1-8

Témata: 0203 mechanical engineering, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Přístupová URL adresa: https://ieeexplore.ieee.org/document/7098673/
https://dblp.uni-trier.de/db/conf/comsnets/comsnets2015.html#NambiarK15

Strongly Convergent Inertial Proximal Point Algorithm Without On-line Rule: Strongly convergent inertial proximal point algorithm without on-line rule

Autoři: Jolaoso, Lateef O. Shehu, Yekini Yao, Jen-Chih

Zdroj: Journal of Optimization Theory and Applications. 200:555-584

Témata: strong convergence, Hilbert spaces, Convex programming, Discrete approximations in optimal control, Nonlinear programming, Analysis of algorithms and problem complexity, Semidefinite programming, maximal monotone operators, two-point inertia, Abstract computational complexity for mathematical programming problems, proximal point algorithm

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/7802200
https://doi.org/10.1007/s10957-023-02355-5