Pages that link to "Item:Q1101013"
From MaRDI portal
The following pages link to An application of simultaneous diophantine approximation in combinatorial optimization (Q1101013):
Displayed 50 items.
- A fast cost scaling algorithm for submodular flow (Q294751) (← links)
- Polynomial kernels for weighted problems (Q340549) (← links)
- Deconstructing intractability-A multivariate complexity analysis of interval constrained coloring (Q533417) (← links)
- Parameterized complexity of coloring problems: treewidth versus vertex cover (Q534566) (← links)
- The minimum feasible tileset problem (Q666670) (← links)
- Parameterizing by the number of numbers (Q692894) (← links)
- Finding vertex-surjective graph homomorphisms (Q715053) (← links)
- Approximating vector scheduling: almost matching upper and lower bounds (Q727975) (← links)
- Approximation algorithms for group prize-collecting and location-routing problems (Q1003471) (← links)
- Test sets of integer programs (Q1298753) (← links)
- A separation algorithm for the matchable set polytope (Q1334957) (← links)
- A fully polynomial epsilon approximation cutting plane algorithm for solving combinatorial linear programs containing a sufficiently large ball (Q1376264) (← links)
- A simplex algorithm for a class of Leontief flow problems (Q1381763) (← links)
- Short vectors of planar lattices via continued fractions (Q1603456) (← links)
- Solving MIPs via scaling-based augmentation (Q1662107) (← links)
- Change-making problems revisited: a parameterized point of view (Q1679517) (← links)
- On the string consensus problem and the Manhattan sequence consensus problem (Q1698720) (← links)
- Multi-attribute proportional representation (Q1731837) (← links)
- A parameterized algorithmics framework for degree sequence completion problems in directed graphs (Q1739111) (← links)
- The complexity landscape of decompositional parameters for ILP (Q1749387) (← links)
- Swapping colored tokens on graphs (Q1749531) (← links)
- On the complexity of wafer-to-wafer integration (Q1751193) (← links)
- Parameterized complexity of asynchronous border minimization (Q1755787) (← links)
- Alliances in graphs of bounded clique-width (Q2030439) (← links)
- Local linear set on graphs with bounded twin cover number (Q2032157) (← links)
- On structural parameterizations of the edge disjoint paths problem (Q2032342) (← links)
- Subexponential parameterized algorithms and kernelization on almost chordal graphs (Q2037110) (← links)
- A combinatorial algorithm for computing the degree of the determinant of a generic partitioned polynomial matrix with \(2\times 2\) submatrices (Q2061866) (← links)
- A polyhedral model for enumeration and optimization over the set of circuits (Q2064285) (← links)
- Short simplex paths in lattice polytopes (Q2117352) (← links)
- A general scheme for solving a large set of scheduling problems with rejection in FPT time (Q2142679) (← links)
- A cost-scaling algorithm for computing the degree of determinants (Q2159472) (← links)
- Abstract tropical linear programming (Q2188843) (← links)
- Parameterized multi-scenario single-machine scheduling problems (Q2196612) (← links)
- Solving hard stable matching problems involving groups of similar agents (Q2205948) (← links)
- On structural parameterizations of the bounded-degree vertex deletion problem (Q2223699) (← links)
- A scaling algorithm for optimizing arbitrary functions over vertices of polytopes (Q2235141) (← links)
- Computation and efficiency of potential function minimizers of combinatorial congestion games (Q2235157) (← links)
- The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints (Q2238737) (← links)
- On explaining integer vectors by few homogeneous segments (Q2256725) (← links)
- ILP models for the allocation of recurrent workloads upon heterogeneous multiprocessors (Q2281614) (← links)
- Partitioning graphs into induced subgraphs (Q2283104) (← links)
- Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting (Q2304553) (← links)
- Parameterized resiliency problems (Q2330129) (← links)
- Parameterized complexity of distance labeling and uniform channel assignment problems (Q2413966) (← links)
- Knapsack problems: a parameterized point of view (Q2419116) (← links)
- On the complexity of quasiconvex integer minimization problem (Q2423784) (← links)
- Approximation schemes for packing splittable items with cardinality constraints (Q2428665) (← links)
- Some \(0/1\) polytopes need exponential size extended formulations (Q2434987) (← links)
- An asymptotically exact algorithm for the high-multiplicity bin packing problem (Q2570998) (← links)