scientific article; zbMATH DE number 1839431
From MaRDI portal
Publication:4782696
zbMath0999.68546MaRDI QIDQ4782696
Publication date: 2 December 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2138/21380045
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (only showing first 100 items - show all)
Computational aspects of the Gromov-Hausdorff distance and its application in non-rigid shape matching ⋮ Packing and covering with balls on Busemann surfaces ⋮ Using Minimum Path Cover to Boost Dynamic Programming on DAGs: Co-linear Chaining Extended ⋮ Minimal Subsidies in Expense Sharing Games ⋮ Parameterized Algorithms for Partial Vertex Covers in Bipartite Graphs ⋮ Fixed Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs ⋮ Fully polynomial-time approximation scheme for a special case of a quadratic Euclidean 2-clustering problem ⋮ On the complexity of some quadratic Euclidean 2-clustering problems ⋮ Recent Advances in Population Protocols ⋮ A Probabilistic PTAS for Shortest Common Superstring ⋮ The Power of Deferral: Maintaining a Constant-Competitive Steiner Tree Online ⋮ Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms ⋮ Approximation-Friendly Discrepancy Rounding ⋮ A primal-dual approximation algorithm for partial vertex cover: Making educated guesses ⋮ Stochastic budget optimization in internet advertising ⋮ Local ratio method on partial set multi-cover ⋮ Randomized Online Algorithms for Set Cover Leasing Problems ⋮ Minimum-Cost $$b$$-Edge Dominating Sets on Trees ⋮ Algorithmic aspects of small quasi-kernels ⋮ Robust Algorithms for TSP and Steiner Tree ⋮ Combinatorial algorithms for solving the constrained knapsack problems with divisible item sizes and penalties ⋮ Set selection under explorable stochastic uncertainty via covering techniques ⋮ Optimal and heuristic algorithms for data collection by using an energy- and storage-constrained drone ⋮ Approximability results for the converse connectedp-centre problem† ⋮ Client assignment problems for latency minimization ⋮ An improved approximation algorithm for the minimum 3-path partition problem ⋮ Efficient, certifiably optimal clustering with applications to latent variable graphical models ⋮ Fair Influence Maximization in Large-scale Social Networks Based on Attribute-aware Reverse Influence Sampling ⋮ Fun with replicas: tripartitions in tensor networks and gravity ⋮ On improved interval cover mechanisms for crowdsourcing markets ⋮ Nash welfare guarantees for fair and efficient coverage ⋮ Making clusterings fairer by post-processing: algorithms, complexity results and experiments ⋮ Pruning 2-connected graphs ⋮ Near-linear approximation algorithms for geometric hitting sets ⋮ The complexity of counting Eulerian tours in 4-regular graphs ⋮ An improved approximation for packing big two-bar charts ⋮ Better Guarantees for $k$-Means and Euclidean $k$-Median by Primal-Dual Algorithms ⋮ Routing equal-size messages on a slotted ring ⋮ Approximations for two variants of the Steiner tree problem in the Euclidean plane \(\mathbb R^2\) ⋮ On the Relative Complexity of 15 Problems Related to 0/1-Integer Programming ⋮ Analysis of 2-Opt Heuristic for the Winner Determination Problem Under the Chamberlin-Courant System ⋮ Fractals for Kernelization Lower Bounds ⋮ Algorithms for placing monitors in a flow network ⋮ A $(1+\varepsilon)$-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs ⋮ Computation in Causal Graphs ⋮ On Sparse Discretization for Graphical Games ⋮ Distributed Graph Algorithms and their Complexity: An Introduction ⋮ On the Shortest Common Superstring of NGS Reads ⋮ Branch-and-Bound Method for Just-in-Time Optimization of Radar Search Patterns ⋮ On Variants of the Spanning Star Forest Problem ⋮ Set Covering with Ordered Replacement: Additive and Multiplicative Gaps ⋮ AN IMPLICIT COVER PROBLEM IN WILD POPULATION STUDY ⋮ Approximability of the Subset Sum Reconfiguration Problem ⋮ COMPLETENESS IN DIFFERENTIAL APPROXIMATION CLASSES ⋮ GENERALIZED WATCHMAN ROUTE PROBLEM WITH DISCRETE VIEW COST ⋮ A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem ⋮ Minimum vertex cover in ball graphs through local search ⋮ Linear time algorithms for generalized edge dominating set problems ⋮ Hardness results for approximate pure Horn CNF formulae minimization ⋮ 2-tone colorings in graph products ⋮ ALMOST OPTIMAL SOLUTIONS TO k-CLUSTERING PROBLEMS ⋮ A \(2+\varepsilon\) approximation algorithm for the \(k\)-MST problem ⋮ A method of estimating computational complexity based on input conditions for \(N\)-vehicle problem ⋮ A fast algorithm for the path 2-packing problem ⋮ Hedging uncertainty: approximation algorithms for stochastic optimization problems ⋮ The ferry cover problem ⋮ Traveling salesman problem across well-connected cities and with location-dependent edge lengths ⋮ Approximating Bin Packing with Conflict Graphs via Maximization Techniques ⋮ Graph Stabilization: A Survey ⋮ Discrete Convex Functions on Graphs and Their Algorithmic Applications ⋮ ON COMPUTING LONGEST PATHS IN SMALL GRAPH CLASSES ⋮ Derivation of a Suitable Finite Test Suite for Customized Probabilistic Systems ⋮ Approximation Algorithms for Minimum Chain Vertex Deletion ⋮ Synchronization problems in automata without non-trivial cycles ⋮ Enumerating Vertices of Covering Polyhedra with Totally Unimodular Constraint Matrices ⋮ Travelling on graphs with small highway dimension ⋮ On Approximating an Implicit Cover Problem in Biology ⋮ Algorithms for Placing Monitors in a Flow Network ⋮ On the Complexity of Clustering with Relaxed Size Constraints ⋮ A Generic Algorithm for Approximately Solving Stochastic Graph Optimization Problems ⋮ An Approximation Algorithm for Fully Planar Edge-Disjoint Paths ⋮ Unnamed Item ⋮ Parameterized analysis of the online priority and node-weighted Steiner tree problems ⋮ Socially desirable approximations for dodgson’s voting rule ⋮ Computing (and Life) Is All about Tradeoffs ⋮ On the hardness of approximating the min-hack problem ⋮ Unnamed Item ⋮ Capacitated domination: problem complexity and approximation algorithms ⋮ An $O(\log \log m)$ Prophet Inequality for Subadditive Combinatorial Auctions ⋮ Moderately exponential time and fixed parameter approximation algorithms ⋮ Complexity of the weighted max-cut in Euclidean space ⋮ Abstraction and approximation in fuzzy temporal logics and models ⋮ New approximation results for resource replication problems ⋮ On the minimum number of Steiner points of constrained 1-line-fixed Steiner tree in the Euclidean plane \(\mathbb{R}^2\) ⋮ How to catch marathon cheaters: new approximation algorithms for tracking paths ⋮ Theoretical complexity of grid cover problems used in radar applications ⋮ Models of greedy algorithms for graph problems ⋮ Online unit clustering and unit covering in higher dimensions ⋮ Approximability and exact resolution of the multidimensional binary vector assignment problem ⋮ On residual approximation in solution extension problems
This page was built for publication:
