Faster Algebraic Algorithms for Path and Packing Problems

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-540-70575-8_47
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Algebraic Algorithms for LWE Problems

ACM Communications in Computer Algebra
MathematicsComputational MathematicsComputational Theory
2015English

Faster Scaling Algorithms for General Graph Matching Problems

1989English

Probabilistic Analysis of Algorithms for Dual Bin Packing Problems

Journal of Algorithms
1991English

Algorithms for Static and Dynamic Path Problems in Trees

English

Optimization Problems and Algorithms in Double-Layered Food Packing Systems

Journal of Advanced Mechanical Design, Systems and Manufacturing
IndustrialMechanical EngineeringManufacturing Engineering
2010English

Approximation Algorithms for General Packing Problems With Modified Logarithmic Potential Function

2002English

I/O-Efficient Algorithms for Shortest Path Related Problems

English

Approximation Algorithms and Complexity Results for Path Problems in Trees of Rings

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2001English

Subquadratic Algorithms for Algebraic 3SUM

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy