The following pages link to (Q3002852):
Displayed 50 items.
- Reroute sequence planning in telecommunication networks and compact vector summation. (Q1428596) (← links)
- On the algebraic complexity of some families of coloured Tutte polynomials (Q1433009) (← links)
- On the minimum label spanning tree problem (Q1567494) (← links)
- Interactive and probabilistic proof-checking (Q1577488) (← links)
- Approximating minimum feedback vertex sets in hypergraphs (Q1583598) (← links)
- Fixed topology alignment with recombination (Q1585336) (← links)
- Linear time-approximation algorithms for bin packing (Q1591548) (← links)
- On-line scheduling revisited (Q1592757) (← links)
- Evolutionary local search for the edge-biconnectivity augmentation problem (Q1603576) (← links)
- Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem. (Q1608333) (← links)
- The hardness of placing street names in a Manhattan type map (Q1608339) (← links)
- A cutting plane approach for integrated planning and scheduling (Q1761978) (← links)
- Measuring instance difficulty for combinatorial optimization problems (Q1762054) (← links)
- Exponential penalty function control of loss networks (Q1769408) (← links)
- The approximability of non-Boolean satisfiability problems and restricted integer programming (Q1770383) (← links)
- Polynomial approximation algorithms with performance guarantees: an introduction-by-example (Q1771343) (← links)
- Core instances for testing: a case study (Q1779532) (← links)
- Batched bin packing (Q1779689) (← links)
- On complexity of unconstrained hyperbolic 0--1 programming problems (Q1779713) (← links)
- Regret in the on-line decision problem (Q1818283) (← links)
- Strong lower bounds for the prize collecting Steiner problem in graphs (Q1827870) (← links)
- On approximation of max-vertex-cover (Q1848386) (← links)
- A reduction technique for weighted grouping problems (Q1848576) (← links)
- Optimization with randomized search heuristics -- the (A)NFL theorem, realistic scenarios, and difficult functions. (Q1853460) (← links)
- Maximum subset intersection (Q1944892) (← links)
- Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost (Q1949749) (← links)
- A lower bound of \(1+\varphi \) for truthful scheduling mechanisms (Q1949759) (← links)
- Approximation algorithms for constructing some required structures in digraphs (Q2255946) (← links)
- The freight consolidation and containerization problem (Q2256168) (← links)
- Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs (Q2266936) (← links)
- Obtaining matrices with the consecutive ones property by row deletions (Q2343088) (← links)
- Approximating the optimal sequence of acquisitions and sales with a capped budget (Q2348705) (← links)
- Offline black and white bin packing (Q2355707) (← links)
- Direct routing: Algorithms and complexity (Q2369874) (← links)
- A faster combinatorial approximation algorithm for scheduling unrelated parallel machines (Q2373738) (← links)
- Dynamic bin packing of unit fractions items (Q2378533) (← links)
- Primal-dual approximation algorithms for the prize-collecting Steiner tree problem (Q2379971) (← links)
- Maximizing the guarded boundary of an Art Gallery is APX-complete (Q2385696) (← links)
- A 2-approximation NC algorithm for connected vertex cover and tree cover (Q2390219) (← links)
- A primal-dual approximation algorithm for partial vertex cover: Making educated guesses (Q2391176) (← links)
- Approximation of the quadratic set covering problem (Q2427697) (← links)
- Pruning 2-connected graphs (Q2428662) (← links)
- A competitive analysis for balanced transactional memory workloads (Q2429336) (← links)
- Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization (Q2437764) (← links)
- Critical edges for the assignment problem: complexity and exact resolution (Q2450758) (← links)
- A simple randomized scheme for constructing low-weight \(k\)-connected spanning subgraphs with applications to distributed algorithms (Q2456363) (← links)
- An analysis of totally clairvoyant scheduling (Q2464437) (← links)
- Two-dimensional bin packing with one-dimensional resource augmentation (Q2467124) (← links)
- Online bin packing with arbitrary release times (Q2474079) (← links)
- A fast asymptotic approximation scheme for bin packing with rejection (Q2481948) (← links)