Pages that link to "Item:Q3010438"
From MaRDI portal
The following pages link to The Design of Approximation Algorithms (Q3010438):
Displayed 50 items.
- Minimum constellation covers: hardness, approximability and polynomial cases (Q2025056) (← links)
- Approximation of the double traveling salesman problem with multiple stacks (Q2034797) (← links)
- On approximations for constructing 1-line minimum rectilinear Steiner trees in the Euclidean plane \(\mathbb{R}^2\) (Q2039643) (← links)
- Search complexity: a way for the quantitative analysis of the search space (Q2039682) (← links)
- Real-time solving of computationally hard problems using optimal algorithm portfolios (Q2043446) (← links)
- Disruption recovery at airports: ground holding, curfew restrictions and an approximation algorithm (Q2059190) (← links)
- Computing in combinatorial optimization (Q2075761) (← links)
- A simple rounding scheme for multistage optimization (Q2077374) (← links)
- A literature review on correlation clustering: cross-disciplinary taxonomy with bibliometric analysis (Q2079285) (← links)
- An approximation algorithm for a general class of multi-parametric optimization problems (Q2082173) (← links)
- An approximation algorithm for the maximum spectral subgraph problem (Q2082202) (← links)
- \(1\)-line minimum rectilinear Steiner trees and related problems (Q2084647) (← links)
- On the complexity of approximately matching a string to a directed graph (Q2084771) (← links)
- Weighted completion time minimization for capacitated parallel machines (Q2085744) (← links)
- Finding colorful paths in temporal graphs (Q2086641) (← links)
- MUL-tree pruning for consistency and optimal reconciliation -- complexity and algorithms (Q2089669) (← links)
- Tight approximation bounds for the LPT rule applied to identical parallel machines with small jobs (Q2093193) (← links)
- Introducing \textsf{lop}-kernels: a framework for kernelization lower bounds (Q2093577) (← links)
- Learning residual alternating automata (Q2105462) (← links)
- LP-based algorithms for multistage minimization problems (Q2117680) (← links)
- Provable randomized rounding for minimum-similarity diversification (Q2134050) (← links)
- Online unit clustering and unit covering in higher dimensions (Q2134741) (← links)
- Bin packing with divisible item sizes and rejection penalties (Q2136894) (← links)
- The limit of targeting in networks (Q2138068) (← links)
- On the fine-grained parameterized complexity of partial scheduling to minimize the makespan (Q2161009) (← links)
- A stochastic approach to handle resource constraints as knapsack problems in ensemble pruning (Q2163207) (← links)
- A simple LP-based approximation algorithm for the matching augmentation problem (Q2164677) (← links)
- The two-stripe symmetric circulant TSP is in P (Q2164712) (← links)
- Bifactor approximation for location routing with vehicle and facility capacities (Q2171591) (← links)
- The parameterized hardness of the \(k\)-center problem in transportation networks (Q2182096) (← links)
- Group parking permit problems (Q2184679) (← links)
- The matching augmentation problem: a \(\frac{7}{4}\)-approximation algorithm (Q2191772) (← links)
- Mean estimation with sub-Gaussian rates in polynomial time (Q2196216) (← links)
- Breaking symmetries to rescue sum of squares in the case of makespan scheduling (Q2196315) (← links)
- An approximation algorithm for the \(k\)-prize-collecting multicut on a tree problem (Q2205937) (← links)
- Approximability of the dispersed \(\vec{p}\)-neighbor \(k\)-supplier problem (Q2217474) (← links)
- Additive approximation algorithms for modularity maximization (Q2221809) (← links)
- On the cycle augmentation problem: hardness and approximation algorithms (Q2230719) (← links)
- Partitioned EDF scheduling on a few types of unrelated multiprocessors (Q2251370) (← links)
- Hardness results for approximate pure Horn CNF formulae minimization (Q2254607) (← links)
- Optimizing node infiltrations in complex networks by a local search based heuristic (Q2273672) (← links)
- Local search approximation algorithms for the sum of squares facility location problems (Q2274862) (← links)
- On the approximability of the two-phase knapsack problem (Q2279756) (← links)
- Approximation of Steiner forest via the bidirected cut relaxation (Q2279758) (← links)
- Exact and approximate algorithms for discounted \(\{0\text{-}1\}\) knapsack problem (Q2282074) (← links)
- Approximation algorithms for the connected sensor cover problem (Q2290655) (← links)
- Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem (Q2292156) (← links)
- On sparse reflexive generalized inverse (Q2294248) (← links)
- Assortment optimization under the multinomial logit model with product synergies (Q2294378) (← links)
- A simple algorithm for the multiway cut problem (Q2294387) (← links)