The following pages link to (Q4782696):
Displaying 50 items.
- Seriation in the presence of errors: NP-hardness of \(l_{\infty}\)-fitting Robinson structures to dissimilarity matrices (Q263094) (← links)
- Error bounds for mixed integer linear optimization problems (Q263186) (← links)
- New approximation results for resource replication problems (Q270001) (← links)
- A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron (Q304258) (← links)
- A primal-dual approximation algorithm for a two depot heterogeneous traveling salesman problem (Q315496) (← links)
- Approximations for constructing tree-form structures using specific material with fixed length (Q315511) (← links)
- A minimized-rule based approach for improving data currency (Q326482) (← links)
- Hardness of reoptimization of the problem of calculating the chromatic number of a graph with a given set of optimal solutions (Q334238) (← links)
- Fast machine reassignment (Q338866) (← links)
- On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree (Q344954) (← links)
- Towards the price of leasing online (Q346515) (← links)
- Unbalanced graph partitioning (Q372961) (← links)
- Towards duality of multicommodity multiroute cuts and flows: multilevel ball-growing (Q372974) (← links)
- Testing additive integrality gaps (Q378120) (← links)
- Computational complexity and approximation for a generalization of the Euclidean problem on the Chebyshev center (Q378186) (← links)
- The school bus problem on trees (Q378249) (← links)
- Reoptimization of constraint satisfaction problems with approximation resistant predicates (Q380664) (← links)
- An iterative rounding 2-approximation algorithm for the \(k\)-partial vertex cover problem (Q403490) (← links)
- Tree metrics and edge-disjoint \(S\)-paths (Q463719) (← links)
- On the approximation ratio threshold for the reoptimization of the maximum number of satisfied equations in linear systems over a finite field (Q466374) (← links)
- The feedback arc set problem with triangle inequality is a vertex cover problem (Q486997) (← links)
- Augmenting graphs to minimize the diameter (Q494792) (← links)
- A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing (Q494936) (← links)
- The worm process for the Ising model is rapidly mixing (Q504198) (← links)
- On the complexity and approximability of some Euclidean optimal summing problems (Q506239) (← links)
- Approximation algorithm for partial positive influence problem in social network (Q511731) (← links)
- On robust clusters of minimum cardinality in networks (Q513606) (← links)
- A partition-based relaxation for Steiner trees (Q535014) (← links)
- Seriation in the presence of errors: a factor 16 approximation algorithm for \(l_{\infty }\)-fitting Robinson structures to distances (Q633846) (← links)
- The negative cycles polyhedron and hardness of checking some polyhedral properties (Q646701) (← links)
- New geometry-inspired relaxations and algorithms for the metric Steiner tree problem (Q647390) (← links)
- Fixed-parameter approximations for \(k\)-center problems in low highway dimension graphs (Q666662) (← links)
- 3-approximation algorithm for a two depot, heterogeneous traveling salesman problem (Q691417) (← links)
- Interdependent defense games with applications to internet security at the level of autonomous systems (Q725097) (← links)
- Partial covering arrays: algorithms and asymptotics (Q726106) (← links)
- Convex relaxations of penalties for sparse correlated variables with bounded total variation (Q747277) (← links)
- Prototype selection for interpretable classification (Q765979) (← links)
- About Lagrangian methods in integer optimization (Q817183) (← links)
- On the minimum number of Steiner points of constrained 1-line-fixed Steiner tree in the Euclidean plane \(\mathbb{R}^2\) (Q828689) (← links)
- How to catch marathon cheaters: new approximation algorithms for tracking paths (Q832889) (← links)
- Models of greedy algorithms for graph problems (Q834580) (← links)
- Games of fixed rank: a hierarchy of bimatrix games (Q847799) (← links)
- Approximating the minimal sensor selection for supervisory control (Q853685) (← links)
- Enumerating disjunctions and conjunctions of paths and cuts in reliability theory (Q867855) (← links)
- On the \(L_{\infty}\)-norm of extreme points for crossing supermodular directed network LPs (Q877196) (← links)
- Approximate min-max relations for odd cycles in planar graphs (Q877199) (← links)
- A hard dial-a-ride problem that is easy on average (Q880497) (← links)
- NP-hardness of some quadratic Euclidean 2-clustering problems (Q906118) (← links)
- Approximately fair cost allocation in metric traveling salesman games (Q927408) (← links)
- On short paths interdiction problems: Total and node-wise limited interdiction (Q929289) (← links)
