Suchergebnisse - 68q25: analysis of algorithms AND problems complexity~

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

Autoren: Mark de Berg Arpan Sadhukhan Frits Spieksma et al.

Weitere Verfasser: Mark de Berg Arpan Sadhukhan Frits Spieksma et al.

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

Schlagwörter: 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

Dateibeschreibung: application/xml; application/pdf

Zugangs-URL: 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

Mixed Precision HODLR Matrices: Mixed precision HODLR matrices

Autoren: Erin Carson Xinye Chen Xiaobo Liu et al.

Weitere Verfasser: Erin Carson Xinye Chen Xiaobo Liu et al.

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

Schlagwörter: 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

Dateibeschreibung: application/xml; application/pdf

Zugangs-URL: http://arxiv.org/abs/2407.21637
https://hal.science/hal-05066310v1
https://doi.org/10.1137/24m1683925
https://hal.science/hal-05066310v1/document

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

Autoren: Nizar Bousselmi Julien M. Hendrickx François Glineur et al.

Weitere Verfasser: Nizar Bousselmi Julien M. Hendrickx François Glineur et al.

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

Schlagwörter: 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

Dateibeschreibung: application/xml

Zugangs-URL: http://arxiv.org/abs/2302.08781
https://zbmath.org/7909893
https://doi.org/10.1137/23m1575391
https://hdl.handle.net/2078.1/293045

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

Autoren: Kandappan, V. A. Gujjula, Vaishnavi Ambikasaran, Sivaram

Quelle: Numerical Algorithms. 97:1635-1672

Schlagwörter: 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

Dateibeschreibung: application/xml

Zugangs-URL: http://arxiv.org/abs/2307.16303
https://zbmath.org/7958575
https://doi.org/10.1007/s11075-024-01765-4

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

Autoren: Francisco López Lars Karlsson Paolo Bientinesi

Quelle: Journal of Combinatorial Optimization. 49

Schlagwörter: 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

Dateibeschreibung: application/xml; application/pdf

Zugangs-URL: http://arxiv.org/abs/2303.17352
http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-238200

A linear time algorithm for linearizing quadratic and higher-order shortest path problems: A linear time algorithm for linearizing quadratic...: E. Çela et al.

Autoren: Çela, Eranda Klinz, Bettina Lendl, Stefan et al.

Quelle: Mathematical Programming. Mar2025, Vol. 210 Issue 1, p165-188. 24p.

Schlagwörter: *QUADRATIC programming, *COMBINATORIAL optimization, *ALGORITHMS

(Re)packing Equal Disks into Rectangle.

Autoren: Fomin, Fedor V. Golovach, Petr A. Inamdar, Tanmay et al.

Quelle: Discrete & Computational Geometry. Dec2024, Vol. 72 Issue 4, p1596-1629. 34p.

Schlagwörter: *COMPUTATIONAL geometry, *NP-hard problems, *COMPUTATIONAL complexity, *PROBLEM solving, *INTEGERS

Improved Bounds for the Expected Number of k-Sets: Improved bounds for the expected number of \(k\)-sets

Autoren: Brett Leroux Luis Rademacher

Quelle: Discrete & Computational Geometry. 70:790-815

Schlagwörter: Lattices and convex bodies in \(2\) dimensions (aspects of discrete geometry), random point configurations, Analysis of algorithms and problem complexity, Probability (math.PR), Metric Geometry (math.MG), 52C05, 52C10, 05C30, 60D05, 68Q25, 0102 computer and information sciences, Enumeration in graph theory, 01 natural sciences, Erdős problems and related topics of discrete geometry, \(k\)-set, Mathematics - Metric Geometry, \(k\)-facet, FOS: Mathematics, Mathematics - Combinatorics, Geometric probability and stochastic geometry, Combinatorics (math.CO), 0101 mathematics, Mathematics - Probability, geometric set systems

Dateibeschreibung: application/xml

Zugangs-URL: http://arxiv.org/abs/2106.04782

Towards a Realistic Analysis of Some Popular Sorting Algorithms

Autoren: Clément, Julien Nguyen Thi, Thu Hien Vallée, Brigitte et al.

Weitere Verfasser: Clément, Julien Nguyen Thi, Thu Hien Vallée, Brigitte et al.

Quelle: Combinatorics, Probability and Computing. 24:104-144

Schlagwörter: [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], 68Q87, 68P10, 68Q17Secondary 68W05, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems/F.2.2.6: Sorting and searching, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], 68Q25, 68W40, 94A17, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0102 computer and information sciences, 68P05, 94A15, 01 natural sciences, 30D10, 30E20, 30E15, 97I80, [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-IT] Computer Science [cs]/Information Theory [cs.IT], 0101 mathematics, Primary 68W32

Dateibeschreibung: application/pdf

Zugangs-URL: https://hal.archives-ouvertes.fr/hal-01103998/file/cpc-PF-style.pdf
https://dblp.uni-trier.de/db/journals/cpc/cpc24.html#ClementTV15
https://hal.archives-ouvertes.fr/hal-01103998

A deterministic algorithm for the discrete logarithm problem in a semigroup

Autoren: Tinani Simran Rosenthal Joachim

Quelle: Journal of Mathematical Cryptology, Vol 16, Iss 1, Pp 141-155 (2022)

Schlagwörter: discrete logarithm problem, semigroups, complexity of algorithms, 20m13, 68q25, 94a60, Mathematics, QA1-939

Dateibeschreibung: electronic resource

Relation: https://doaj.org/toc/1862-2984

Zugangs-URL: https://doaj.org/article/dce4f7c6cf5340c5a48cd71e503fbd93

Advances on strictly Δ-modular IPs: Advances on strictly Δ-modular IPs: M. Nägele et al.

Autoren: Nägele, Martin Nöbel, Christian Santiago, Richard et al.

Quelle: Mathematical Programming. Mar2025, Vol. 210 Issue 1, p731-760. 30p.

Schlagwörter: *MATHEMATICAL programming, *INTEGER programming, *ALGORITHMS, COMBINATORIAL optimization, CUTTING stock problem

On complexity of the word problem in braid groups and mapping class groups

Autoren: Hessam Hamidi-Tehrani

Quelle: Topology and its Applications. 105:237-259

Schlagwörter: Fundamental group, presentations, free differential calculus, π1 -train-track, Analysis of algorithms and problem complexity, Topology of the Euclidean \(2\)-space, \(2\)-manifolds, Word problems, other decision problems, connections with logic and automata (group-theoretic aspects), Geometric Topology (math.GT), Complexity, 0102 computer and information sciences, Braid groups, Artin groups, mapping class groups, 20F10, 68Q25, 57S05, 01 natural sciences, Word problem, word problems, Mathematics - Geometric Topology, Mapping class group, Braid group, FOS: Mathematics, braid groups, Geometry and Topology, 0101 mathematics, Measured train-track

Dateibeschreibung: application/xml

Zugangs-URL: http://arxiv.org/abs/math/9809154
https://www.sciencedirect.com/science/article/pii/S0166864199000632
https://www.sciencedirect.com/science/article/abs/pii/S0166864199000632

An Online Algorithm for Improving Performance in Navigation: An online algorithm for improving performance in navigation

Autoren: Avrim Blum Prasad Chalasani

Quelle: SIAM Journal on Computing. 29:1907-1938

Schlagwörter: FOS: Computer and information sciences, learning, online algorithms, Analysis of algorithms and problem complexity, exploration vs.\ exploitation, robot path planning, 68Q25, 02 engineering and technology, 0102 computer and information sciences, Computational Complexity (cs.CC), 01 natural sciences, unfamiliar terrain, lower bounds, Computer Science - Computational Complexity, FOS: Mathematics, 0202 electrical engineering, electronic engineering, information engineering, Mathematics - Combinatorics, competitive analysis, Combinatorics (math.CO), 0101 mathematics, navigation

Dateibeschreibung: application/xml

Zugangs-URL: http://www.aladdin.cs.cmu.edu/papers/pdfs/y2000/navig.pdf
http://arxiv.org/pdf/math/9409224
http://arxiv.org/abs/math/9409224
https://zbmath.org/1519235
https://doi.org/10.1137/s0097539795290593
https://arxiv.org/abs/math/9409224
https://dblp.uni-trier.de/db/conf/focs/focs93.html#BlumC93
https://www.computer.org/csdl/proceedings-article/focs/1993/0366887/12OmNx965CH
https://epubs.siam.org/doi/pdf/10.1137/S0097539795290593
https://ieeexplore.ieee.org/document/366887/
http://ieeexplore.ieee.org/document/366887/
https://epubs.siam.org/doi/10.1137/S0097539795290593
https://dblp.uni-trier.de/db/journals/siamcomp/siamcomp29.html#BlumC00
https://locus.siam.org/doi/abs/10.1137/S0097539795290593

On the optimality of pseudo-polynomial algorithms for integer programming.

Autoren: Fomin, Fedor V. Panolan, Fahad Ramanujan, M. S. et al.

Quelle: Mathematical Programming. Mar2023, Vol. 198 Issue 1, p561-593. 33p.

Schlagwörter: *NONNEGATIVE matrices, *INTEGER programming, *COMPUTABLE functions, *ALGORITHMS

The full Steiner tree problem

Autoren: Chin Lung Lu Chuan Yi Tang Richard Chia Tung Lee

Quelle: Theoretical Computer Science. 306:55-67

Schlagwörter: Full Steiner tree problem, Analysis of algorithms and problem complexity, Evolutionary tree, 0102 computer and information sciences, Approximation algorithm, 01 natural sciences, Approximation algorithms, Theoretical Computer Science, Graph theory (including graph drawing) in computer science, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), 0101 mathematics, Approximation algorithmq17 68q25 68w25, MAX SNP-hard, Phylogenetic tree, NP-complete, Computer Science(all)

Dateibeschreibung: application/xml

Zugangs-URL: https://ir.nctu.edu.tw:443/bitstream/11536/27537/1/000185261500004.pdf
https://dblp.uni-trier.de/db/journals/tcs/tcs306.html#LuTL03
https://www.sciencedirect.com/science/article/abs/pii/S0304397503002093
https://doi.org/10.1016/S0304-3975(03)00209-3
https://www.sciencedirect.com/science/article/pii/S0304397503002093
https://dl.acm.org/doi/10.5555/2780722.2781476

The complexity of approximating PSPACE-Complete problems for hierarchical specifications: The complexity of approximating PSPACE-complete problems for hierarchical specifications

Autoren: Marathe, Madhav V. Hunt, Harry B. III Ravi, S. S.

Schlagwörter: FOS: Computer and information sciences, Specification and verification (program logics, model checking, etc.), Analysis of algorithms and problem complexity, 68Q25, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 01 natural sciences, hierarchically specified graphs, Computer Science - Computational Complexity, Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.), Graph theory (including graph drawing) in computer science, polynomial time approximation algorithms, 0202 electrical engineering, electronic engineering, information engineering, FOS: Mathematics, Complexity classes (hierarchies, relations among complexity classes, etc.), Mathematics - Combinatorics, Combinatorics (math.CO)

Dateibeschreibung: application/xml

Zugangs-URL: http://arxiv.org/abs/math/9409225
https://zbmath.org/751134

A simple linear-time algorithm for finding path-decompositions of small width

Autoren: Kevin Cattell Michael R. Fellows Michael J. Dinneen

Quelle: Information Processing Letters. 57:197-203

Schlagwörter: Analysis of algorithms and problem complexity, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Combinatorial problems, Graph theory (including graph drawing) in computer science, Graph algorithms (graph-theoretic aspects), FOS: Mathematics, Mathematics - Combinatorics, Analysis of algorithms, Combinatorics (math.CO), 05c85 68q25, Algorithms

Dateibeschreibung: application/xml

Zugangs-URL: http://arxiv.org/pdf/math/9410211
http://arxiv.org/abs/math/9410211
https://zbmath.org/984784
https://doi.org/10.1016/0020-0190(95)00190-5
http://www.sciencedirect.com/science/article/pii/0020019095001905
https://doi.org/10.1016/0020-0190(95)00190-5
https://core.ac.uk/display/23584468
https://dblp.uni-trier.de/db/journals/ipl/ipl57.html#CattellDF96
http://ui.adsabs.harvard.edu/abs/1994math.....10211C/abstract
https://arxiv.org/pdf/math/9410211

A finite time combinatorial algorithm for instantaneous dynamic equilibrium flows.

Autoren: Graf, Lukas Harks, Tobias

Quelle: Mathematical Programming. Feb2023, Vol. 197 Issue 2, p761-792. 32p.

Schlagwörter: *TRAFFIC assignment, *EQUILIBRIUM, *GRANULAR flow, *ALGORITHMS

Fine-Grained Parameterized Complexity Analysis of Graph Coloring Problems

Autoren: Jaffke, Lars Jansen, Bart M. P.

Index Begriffe: Computer Science - Data Structures and Algorithms, Computer Science - Computational Complexity, 05C85, 68Q25, F.2.2, G.2.2, text

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

Kronecker's and Newton's Approaches to Solving: A First Comparison: Kronecker's and Newton's approaches to solving: a first comparison

Autoren: J.E. Morais D. Castro K. Hägele et al.

Quelle: Journal of Complexity. 17:212-303

Schlagwörter: Statistics and Probability, Control and Optimization, Analysis of algorithms and problem complexity, height of diophantine varieties, Newton operator, Symbolic computation and algebraic computation, 01 natural sciences, approximate zero, Mathematics - Algebraic Geometry, FOS: Mathematics, Computational aspects of field theory and polynomials, Mathematics - Numerical Analysis, Number Theory (math.NT), 0101 mathematics, degree of algebraic varieties, Nonnumerical algorithms, Algebraic Geometry (math.AG), 11D72,11J17,11J61,11J68, 11Y05, 68Q25, Numerical Analysis, Algebra and Number Theory, Mathematics - Number Theory, straight-line programs, Applied Mathematics, Turing machine complexity, Numerical Analysis (math.NA), Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), Numerical computation of solutions to single equations, Kronecker's solution

Dateibeschreibung: application/xml

Zugangs-URL: http://arxiv.org/abs/math/9908082
http://www.tara.tcd.ie/bitstream/2262/13021/1/TCD-CS-1999-47.pdf
https://www.sciencedirect.com/science/article/abs/pii/S0885064X00905727
https://www.sciencedirect.com/science/article/pii/S0885064X00905727
https://dblp.uni-trier.de/db/journals/jc/jc17.html#CastroPHM01
https://core.ac.uk/display/82226566
http://www.tara.tcd.ie/handle/2262/13021