Publication:4782696
From MaRDI portal
zbMath0999.68546MaRDI QIDQ4782696
Publication date: 2 December 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2138/21380045
Related Items
ALMOST OPTIMAL SOLUTIONS TO k-CLUSTERING PROBLEMS, COMPLETENESS IN DIFFERENTIAL APPROXIMATION CLASSES, A partition-based relaxation for Steiner trees, Seriation in the presence of errors: a factor 16 approximation algorithm for \(l_{\infty }\)-fitting Robinson structures to distances, The negative cycles polyhedron and hardness of checking some polyhedral properties, New geometry-inspired relaxations and algorithms for the metric Steiner tree problem, Prototype selection for interpretable classification, About Lagrangian methods in integer optimization, Models of greedy algorithms for graph problems, Games of fixed rank: a hierarchy of bimatrix games, Approximating the minimal sensor selection for supervisory control, Enumerating disjunctions and conjunctions of paths and cuts in reliability theory, On the \(L_{\infty}\)-norm of extreme points for crossing supermodular directed network LPs, Approximate min-max relations for odd cycles in planar graphs, A hard dial-a-ride problem that is easy on average, Approximately fair cost allocation in metric traveling salesman games, On short paths interdiction problems: Total and node-wise limited interdiction, Generating cut conjunctions in graphs and related problems, Improved algorithms and complexity results for power domination in graphs, Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles, Modularity-maximizing graph communities via mathematical programming, A robust APTAS for the classical bin packing problem, Approximation algorithms for multi-criteria traveling salesman problems, Path hitting in acyclic graphs, Greedy splitting algorithms for approximating multiway partition problems, A method of estimating computational complexity based on input conditions for \(N\)-vehicle problem, A fast algorithm for the path 2-packing problem, The ferry cover problem, A primal-dual approximation algorithm for partial vertex cover: Making educated guesses, Pruning 2-connected graphs, Near-linear approximation algorithms for geometric hitting sets, The complexity of counting Eulerian tours in 4-regular graphs, Linear time algorithms for generalized edge dominating set problems, A \(2+\varepsilon\) approximation algorithm for the \(k\)-MST problem, Hedging uncertainty: approximation algorithms for stochastic optimization problems, On the hardness of approximating the min-hack problem, On Variants of the Spanning Star Forest Problem, Set Covering with Ordered Replacement: Additive and Multiplicative Gaps, Approximability of the Subset Sum Reconfiguration Problem, ON COMPUTING LONGEST PATHS IN SMALL GRAPH CLASSES, Approximation Algorithms for Minimum Chain Vertex Deletion, Minimal Subsidies in Expense Sharing Games, Recent Advances in Population Protocols, A Probabilistic PTAS for Shortest Common Superstring, Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms, AN IMPLICIT COVER PROBLEM IN WILD POPULATION STUDY, GENERALIZED WATCHMAN ROUTE PROBLEM WITH DISCRETE VIEW COST, Derivation of a Suitable Finite Test Suite for Customized Probabilistic Systems, On Approximating an Implicit Cover Problem in Biology, Algorithms for Placing Monitors in a Flow Network, A Generic Algorithm for Approximately Solving Stochastic Graph Optimization Problems
