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)
- Approximation algorithms for constructing specific subgraphs with minimum number of length-bounded stock pieces (Q1641150) (← links)
- The complexity of probabilistic lobbying (Q1662102) (← links)
- Dynamic bin packing with unit fraction items revisited (Q1675820) (← links)
- Total variation discrepancy of deterministic random walks for ergodic Markov chains (Q1675930) (← links)
- Approximability and inapproximability of the star \(p\)-hub center problem with parameterized triangle inequality (Q1678171) (← links)
- Bin packing under linear constraints (Q1679514) (← links)
- Maximum coverage problem with group budget constraints (Q1680483) (← links)
- Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities (Q1694821) (← links)
- An approximation algorithm for soft capacitated \(k\)-facility location problem (Q1702830) (← links)
- LP-relaxations for tree augmentation (Q1706120) (← links)
- A theory and algorithms for combinatorial reoptimization (Q1709582) (← links)
- Active influence spreading in social networks (Q1731507) (← links)
- Disruption recovery at airports: integer programming formulations and polynomial time algorithms (Q1744246) (← links)
- Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes (Q1751665) (← links)
- Colocating tasks in data centers using a side-effects performance model (Q1754339) (← links)
- Approximation algorithms for highly connected multi-dominating sets in unit disk graphs (Q1755744) (← 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)
- Fast distributed approximation for TAP and 2-edge-connectivity (Q1988524) (← links)
- Paired-domination problem on distance-hereditary graphs (Q2006943) (← links)
- Selfish colorful bin packing games (Q2023116) (← links)
- Graph spanners: a tutorial review (Q2026289) (← links)
- Complete-subgraph-transversal-sets problem on bounded treewidth graphs (Q2045031) (← links)
- A hybrid evolutionary algorithm for the offline Bin Packing Problem (Q2045610) (← links)
- On the parametrized complexity of Read-once refutations in UTVPI+ constraint systems (Q2049975) (← links)