Pages that link to "Item:Q3010438"
From MaRDI portal
The following pages link to The Design of Approximation Algorithms (Q3010438):
Displaying 50 items.
- Using Approximation Algorithms to Build Evidence Factors and Related Designs for Observational Studies (Q139209) (← links)
- Combinatorial approximation algorithms for the robust facility location problem with penalties (Q280977) (← links)
- A simple greedy approximation algorithm for the minimum connected \(k\)-center problem (Q281773) (← links)
- Approximation algorithms for stochastic combinatorial optimization problems (Q290321) (← links)
- Integrality gaps for strengthened linear relaxations of capacitated facility location (Q304227) (← links)
- Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period (Q326488) (← links)
- Towards duality of multicommodity multiroute cuts and flows: multilevel ball-growing (Q372974) (← links)
- On the approximability and hardness of minimum topic connected overlay and its special instances (Q418776) (← links)
- Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees (Q489718) (← links)
- Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding (Q490221) (← links)
- Quell (Q500997) (← links)
- Tightness of the maximum likelihood semidefinite relaxation for angular synchronization (Q526833) (← links)
- Optimization with uniform size queries (Q527424) (← links)
- A new approach to low-distortion embeddings of finite metric spaces into non-superreflexive Banach spaces (Q529376) (← links)
- Fixed-parameter approximations for \(k\)-center problems in low highway dimension graphs (Q666662) (← links)
- The A priori traveling repairman problem (Q722527) (← links)
- Approximability of clique transversal in perfect graphs (Q724231) (← links)
- A randomized \(O(\log n)\)-competitive algorithm for the online connected facility location problem (Q727979) (← links)
- \(\text{PSPIKE}+\): A family of parallel hybrid sparse linear system solvers (Q730600) (← links)
- On the maximum betweenness improvement problem (Q737099) (← links)
- Approximate algorithms for unrelated machine scheduling to minimize makespan (Q747046) (← links)
- How to catch marathon cheaters: new approximation algorithms for tracking paths (Q832889) (← links)
- Strong LP formulations for scheduling splittable jobs on unrelated machines (Q896269) (← links)
- Centrality of trees for capacitated \(k\)-center (Q896276) (← links)
- A survey on how the structure of precedence constraints may change the complexity class of scheduling problems (Q1617290) (← links)
- Theoretical complexity of grid cover problems used in radar applications (Q1626552) (← links)
- Knapsack with variable weights satisfying linear constraints (Q1683329) (← links)
- Parameterized approximation via fidelity preserving transformations (Q1686226) (← links)
- Approximation schemes for parallel machine scheduling with non-renewable resources (Q1698888) (← links)
- Approximating bounded-degree spanning trees and connected factors with leaves (Q1728165) (← links)
- Recommending links through influence maximization (Q1731508) (← links)
- The parameterized complexity of the rainbow subgraph problem (Q1736640) (← links)
- Approximation algorithms for connected graph factors of minimum weight (Q1743127) (← links)
- Disruption recovery at airports: integer programming formulations and polynomial time algorithms (Q1744246) (← links)
- Approximation schemes for the generalized traveling salesman problem (Q1744982) (← links)
- Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming (Q1749453) (← links)
- Improved approximation algorithms for the maximum happy vertices and edges problems (Q1750352) (← links)
- An improved approximation algorithm for knapsack median using sparsification (Q1751085) (← links)
- On the complexity of wafer-to-wafer integration (Q1751193) (← links)
- Reference points and approximation algorithms in multicriteria discrete optimization (Q1753504) (← links)
- An approximation algorithm for a competitive facility location problem with network effects (Q1754226) (← links)
- Improved bounds in stochastic matching and optimization (Q1755741) (← links)
- Constant-factor approximations for capacitated arc routing without triangle inequality (Q1785236) (← links)
- A continuous knapsack problem with separable convex utilities: approximation algorithms and applications (Q1785255) (← links)
- Dichotomous binary differential evolution for knapsack problems (Q1793333) (← links)
- Semidefinite and linear programming integrality gaps for scheduling identical machines (Q1800998) (← links)
- Constant factor approximation for ATSP with two edge weights (Q1801010) (← links)
- An introduction to the Ribe program (Q1936714) (← links)
- Geometric and LP-based heuristics for angular travelling salesman problems in the plane (Q2003422) (← links)
- A simple primal-dual approximation algorithm for 2-edge-connected spanning subgraphs (Q2019478) (← links)