- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1432-0541
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
Polynomial Time Algorithms for Tracking Path Problems ; day:8 ; month:2 ; year:2022 ; pages:1-23
Algorithmica ; (8.2.2022), 1-23
- Creator
-
Choudhary, Pratibha
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s00453-022-00931-1
- URN
-
urn:nbn:de:101:1-2022051506510517027274
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:22 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Choudhary, Pratibha
- SpringerLink (Online service)
Other Objects (12)
Mixed precision path tracking for polynomial homotopy continuation
Polynomial time algorithms for network information flow
A hierarchy of polynomial time lattice basis reduction algorithms
Polynomial time algorithms for finding integer relations among real numbers
Polynomial-time algorithms for multimarginal optimal transport problems with structure
Efficient algorithms for solving the p-Laplacian in polynomial time
Fully-polynomial-time approximation schemes for the Euclidean shortest path problem
Algorithms for Time Dependent Bicriteria Shortest Path Problems
Two-agent proportionate flowshop scheduling with deadlines: polynomial-time optimization algorithms
Polynomial-Time Axioms of Choice and Polynomial-Time Cardinality
Polynomial Algorithms for Estimating Network Reliability
Polynomial time calculi
Mixed precision path tracking for polynomial homotopy continuation
Polynomial time algorithms for network information flow
A hierarchy of polynomial time lattice basis reduction algorithms
Polynomial time algorithms for finding integer relations among real numbers
Polynomial-time algorithms for multimarginal optimal transport problems with structure
Efficient algorithms for solving the p-Laplacian in polynomial time
Fully-polynomial-time approximation schemes for the Euclidean shortest path problem
Algorithms for Time Dependent Bicriteria Shortest Path Problems
Two-agent proportionate flowshop scheduling with deadlines: polynomial-time optimization algorithms
Polynomial-Time Axioms of Choice and Polynomial-Time Cardinality
Polynomial Algorithms for Estimating Network Reliability
Polynomial time calculi
Mixed precision path tracking for polynomial homotopy continuation
Polynomial time algorithms for network information flow
A hierarchy of polynomial time lattice basis reduction algorithms
Polynomial time algorithms for finding integer relations among real numbers
Polynomial-time algorithms for multimarginal optimal transport problems with structure
Efficient algorithms for solving the p-Laplacian in polynomial time
Fully-polynomial-time approximation schemes for the Euclidean shortest path problem
Algorithms for Time Dependent Bicriteria Shortest Path Problems
Two-agent proportionate flowshop scheduling with deadlines: polynomial-time optimization algorithms
Polynomial-Time Axioms of Choice and Polynomial-Time Cardinality
Polynomial Algorithms for Estimating Network Reliability