- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1432-0541
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
Polynomial Time Algorithms for Tracking Path Problems ; day:8 ; month:2 ; year:2022 ; pages:1-23
Algorithmica ; (8.2.2022), 1-23
- Urheber
-
Choudhary, Pratibha
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s00453-022-00931-1
- URN
-
urn:nbn:de:101:1-2022051506510517027274
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:22 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Choudhary, Pratibha
- SpringerLink (Online service)
Ähnliche Objekte (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