Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
scientific article; zbMATH DE number 1500530 - MaRDI portal

scientific article; zbMATH DE number 1500530

From MaRDI portal
Publication:4501548

zbMath1028.90044MaRDI QIDQ4501548

Walter Unger, Sebastian Seibert, Juraj Hromkovič, Ralf Klasing, Hans-Joachim Böckenhauer

Publication date: 27 January 2004


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items

Approximation Algorithms for the Traveling Salesman Problem with Range ConditionImproved Lower Bounds on the Approximability of the Traveling Salesman ProblemOn the Complexity of the Star p-hub Center Problem with Parameterized Triangle InequalityApproximation algorithms for the TSP with sharpened triangle inequalityOn the approximability of the single allocation \(p\)-hub center problem with parameterized triangle inequalityOrdered spatial sampling by means of the traveling salesman problemWeighted amplifiers and inapproximability results for travelling salesman problemApproximability and inapproximability of the star \(p\)-hub center problem with parameterized triangle inequalityStability of Reapproximation Algorithms for the $$\beta $$-Metric Traveling Salesman (Path) ProblemA Modern View on Stability of ApproximationApproximating the metric TSP in linear timeNew inapproximability bounds for TSPOn the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequalityOn the Hardness of ReoptimizationApproximation algorithms for the \(p\)-hub center routing problem in parameterized metric graphsOn \(k\)-connectivity problems with sharpened triangle inequalityAlgorithms for the metric ring star problem with fixed edge-cost ratioApproximation algorithms for multi-criteria traveling salesman problemsAutour de nouvelles notions pour l'analyse des algorithmes d'approximation : de la structure de NPO à la structure des instances