Výsledky vyhledávání - "Analysis of Algorithms and Problem Complexity"

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

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

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

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

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

On Uniqueness of Power Sum Decomposition: On uniqueness of power sum decomposition

Autoři: Taveira Blomenhofer, Alexander

Zdroj: SIAM Journal on Applied Algebra and Geometry. 9:211-234

Témata: Computational real algebraic geometry, SDP, Waring decomposition, Estimation in multivariate analysis, Analysis of algorithms and problem complexity, Multilinear algebra, tensor calculus, subspace learning, Gaussian mixtures

Popis souboru: application/xml

From Word-Representable Graphs to Altered Tverberg-Type Theorems: From word-representable graphs to altered Tverberg-type theorems

Autoři: Deborah Oliveros Antonio J. Torres

Zdroj: Discrete & Computational Geometry. 73:293-309

Témata: Computational Geometry (cs.CG), FOS: Computer and information sciences, nerve complexes, combinatorial convexity, Analysis of algorithms and problem complexity, Erdős-Szekeres theorems, Combinatorial aspects of simplicial complexes, Helly-type theorems and geometric transversal theory, 01 natural sciences, Tverberg theorem, FOS: Mathematics, Mathematics - Combinatorics, Computer Science - Computational Geometry, Combinatorics (math.CO), 0101 mathematics, \(k\)-word-representable graphs

Popis souboru: application/xml

Přístupová URL adresa: http://arxiv.org/abs/2111.10038
https://zbmath.org/7986098
https://doi.org/10.1007/s00454-025-00718-5

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

Efficient Convex Optimization Requires Superlinear Memory: Efficient convex optimization requires superlinear memory

Autoři: Annie Marsden Vatsal Sharan Aaron Sidford a další

Zdroj: Journal of the ACM. 71:1-37

Témata: first-order methods, FOS: Computer and information sciences, Convex programming, Computer Science - Machine Learning, convex optimization, Analysis of algorithms and problem complexity, 0211 other engineering and technologies, Machine Learning (stat.ML), 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 01 natural sciences, Machine Learning (cs.LG), Computer Science - Computational Complexity, cutting plane methods, Statistics - Machine Learning, Optimization and Control (math.OC), Computer Science - Data Structures and Algorithms, FOS: Mathematics, Data Structures and Algorithms (cs.DS), memory lower bounds, Mathematics - Optimization and Control

Popis souboru: application/xml

Přístupová URL adresa: http://arxiv.org/abs/2203.15260
https://zbmath.org/8030808
https://doi.org/10.1145/3689208

Smooth approximations: An algebraic approach to CSPs over finitely bounded homogeneous structures: Smooth approximations: an algebraic approach to CSPs over finitely bounded homogeneous structures

Autoři: Antoine Mottet Michael Pinsker

Zdroj: Journal of the ACM

Témata: Logic in computer science, finitely bounded, Computational aspects of satisfiability, Applications of universal algebra in computer science, Analysis of algorithms and problem complexity, Applications of model theory, homogeneous structures, loop lemma, 0102 computer and information sciences, complexity dichotomy, \(\omega\)-categorical structures, 01 natural sciences, polymorphism, standard compactness argument, finitely bounded structures, homogeneous, \omega-categorical, Constraint Satisfaction Problem, 0101 mathematics, constraint satisfaction problem

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/8030803
https://doi.org/10.1145/3689207

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

On the parenthesisations of matrix chains: All are useful, few are essential: On the parenthesisations of matrix chains: all are useful, few are essential

Autoři: Francisco López Lars Karlsson Paolo Bientinesi

Zdroj: Journal of Combinatorial Optimization. 49

Témata: Matrix multiplication, FOS: Computer and information sciences, Discrete Mathematics (cs.DM), Matrix chain, Computer Sciences, Analysis of algorithms and problem complexity, matrix multiplication, Mathematical programming, Theory of compilers and interpreters, Approximation algorithm, Approximation algorithms, linear algebra compilers, matrix chain, 68N20, 68Q25, 68W25, Datavetenskap (datalogi), Linear algebra compilers, approximation algorithm, Computer Science - Discrete Mathematics

Popis souboru: application/xml; application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2303.17352
http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-238200

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

Approximating Maximum Integral Multiflows on Bounded Genus Graphs: Approximating maximum integral multiflows on bounded genus graphs

Autoři: Chien-Chung Huang Mathieu Mari Claire Mathieu a další

Přispěvatelé: Chien-Chung Huang Mathieu Mari Claire Mathieu a další

Zdroj: Discrete & Computational Geometry. 70:1266-1291

Témata: Computational Geometry (cs.CG), FOS: Computer and information sciences, Discrete Mathematics (cs.DM), Analysis of algorithms and problem complexity, 0102 computer and information sciences, [INFO] Computer Science [cs], 01 natural sciences, multicommodity flow, 57M15, 05C38, 05C62, 90C27, 90C35, bounded-genus graphs, Computer Science - Data Structures and Algorithms, Computer Science - Computational Geometry, Multi-commodity flows, Data Structures and Algorithms (cs.DS), ddc:004, bounded genus graphs, 0101 mathematics, approximation algorithms, optimization, Computer Science - Discrete Mathematics

Popis souboru: application/xml; application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2005.00575
https://hal.science/hal-03457015v1
https://zbmath.org/7781563
https://doi.org/10.1007/s00454-023-00552-7
https://drops.dagstuhl.de/opus/volltexte/2021/14149/
https://drops.dagstuhl.de/opus/volltexte/2021/14149/pdf/LIPIcs-ICALP-2021-80.pdf/
https://dblp.uni-trier.de/db/journals/corr/corr2005.html#abs-2005-00575
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.80

Algorithmic Aspects of Outer-Independent Double Roman Domination in Graphs: Algorithmic aspects of outer-independent double Roman domination in graphs

Autoři: Amit Sharma P. Venkata Subba Reddy S. Arumugam a další

Zdroj: International Journal of Foundations of Computer Science. 36:25-34

Témata: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), Analysis of algorithms and problem complexity, domination number, outer-independent double Roman dominating set, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, Higher-order logic, 01 natural sciences, NP-complete

Popis souboru: application/xml

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

Kernelization for feedback vertex set via elimination distance to a forest

Autoři: David J.C. Dekker Bart M.P. Jansen

Zdroj: Discrete Applied Mathematics. 346:192-214

Témata: FOS: Computer and information sciences, F.2.2, G.2.2, elimination distance, 05C85, 68R10, Elimination distance, Analysis of algorithms and problem complexity, Parameterized complexity, tractability and kernelization, feedback vertex set, 0102 computer and information sciences, 01 natural sciences, Graph algorithms (graph-theoretic aspects), Graph theory (including graph drawing) in computer science, kernelization, Computer Science - Data Structures and Algorithms, Kernelization, Data Structures and Algorithms (cs.DS), Feedback vertex set

Popis souboru: application/xml

Přístupová URL adresa: http://arxiv.org/abs/2206.04387
https://zbmath.org/7804729
https://doi.org/10.1016/j.dam.2023.12.016
https://research.tue.nl/en/publications/b547da42-d430-423f-b097-c1ccc4999279
https://doi.org/10.1016/J.DAM.2023.12.016

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

Query lower bounds for log-concave sampling

Autoři: Sinho Chewi Jaume de Dios Pont Jerry Li a další

Přispěvatelé: Sinho Chewi Jaume de Dios Pont Jerry Li a další

Zdroj: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS). :2139-2148

Témata: block Krylov, FOS: Computer and information sciences, Computer Science - Machine Learning, Analysis of algorithms and problem complexity, Learning and adaptive systems in artificial intelligence, matrix-vector queries, Mathematics - Statistics Theory, Machine Learning (stat.ML), Special matrices, Statistics Theory (math.ST), 01 natural sciences, Machine Learning (cs.LG), Statistics - Machine Learning, Computer Science - Data Structures and Algorithms, Sampling theory, sample surveys, FOS: Mathematics, Data Structures and Algorithms (cs.DS), 0101 mathematics, log-concave sampling

Popis souboru: application/xml; application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2304.02599
https://zbmath.org/8030796
https://doi.org/10.1145/3673651