Matches in SemOpenAlex for { <https://semopenalex.org/work/W3081657186> ?p ?o ?g. }
Showing items 1 to 74 of
74
with 100 items per page.
- W3081657186 startingPage "19" @default.
- W3081657186 abstract "Iterative augmentation has recently emerged as an overarching method for solving Integer Programs (IP) in variable dimension, in stark contrast with the volume and flatness techniques of IP in fixed dimension. Here we consider 4-block n-fold integer programs, which are the most general class considered so far. A 4-block n-fold IP has a constraint matrix which consists of n copies of small matrices A, B, and D, and one copy of C, in a specific block structure. Iterative augmentation methods rely on the so-called Graver basis of the constraint matrix, which constitutes a set of fundamental augmenting steps. All existing algorithms rely on bounding the 𝓁₁- or 𝓁_∞-norm of elements of the Graver basis. Hemmecke et al. [Math. Prog. 2014] showed that 4-block n-fold IP has Graver elements of 𝓁_∞-norm at most 𝒪_FPT(n^{2^{s_D}}), leading to an algorithm with a similar runtime; here, s_D is the number of rows of matrix D and 𝒪_FPT hides a multiplicative factor that is only dependent on the small matrices A,B,C,D, However, it remained open whether their bounds are tight, in particular, whether they could be improved to 𝒪_FPT(1), perhaps at least in some restricted cases.We prove that the 𝓁_∞-norm of the Graver elements of 4-block n-fold IP is upper bounded by 𝒪_FPT(n^{s_D}), improving significantly over the previous bound 𝒪_FPT(n^{2^{s_D}}). We also provide a matching lower bound of Ω(n^{s_D}) which even holds for arbitrary non-zero lattice elements, ruling out augmenting algorithm relying on even more restricted notions of augmentation than the Graver basis. We then consider a special case of 4-block n-fold in which C is a zero matrix, called 3-block n-fold IP. We show that while the 𝓁_∞-norm of its Graver elements is Ω(n^{s_D}), there exists a different decomposition into lattice elements whose 𝓁_∞-norm is bounded by 𝒪_FPT(1), which allows us to provide improved upper bounds on the 𝓁_∞-norm of Graver elements for 3-block n-fold IP. The key difference between the respective decompositions is that a Graver basis guarantees a sign-compatible decomposition; this property is critical in applications because it guarantees each step of the decomposition to be feasible. Consequently, our improved upper bounds let us establish faster algorithms for 3-block n-fold IP and 4-block IP, and our lower bounds strongly hint at parameterized hardness of 4-block and even 3-block n-fold IP. Furthermore, we show that 3-block n-fold IP is without loss of generality in the sense that 4-block n-fold IP can be solved in FPT oracle time by taking an algorithm for 3-block n-fold IP as an oracle." @default.
- W3081657186 created "2020-09-08" @default.
- W3081657186 creator A5005114302 @default.
- W3081657186 creator A5008466590 @default.
- W3081657186 creator A5015423805 @default.
- W3081657186 creator A5030598218 @default.
- W3081657186 date "2020-01-01" @default.
- W3081657186 modified "2023-09-27" @default.
- W3081657186 title "New Bounds on Augmenting Steps of Block-Structured Integer Programs." @default.
- W3081657186 doi "https://doi.org/10.4230/lipics.esa.2020.33" @default.
- W3081657186 hasPublicationYear "2020" @default.
- W3081657186 type Work @default.
- W3081657186 sameAs 3081657186 @default.
- W3081657186 citedByCount "2" @default.
- W3081657186 countsByYear W30816571862020 @default.
- W3081657186 crossrefType "proceedings-article" @default.
- W3081657186 hasAuthorship W3081657186A5005114302 @default.
- W3081657186 hasAuthorship W3081657186A5008466590 @default.
- W3081657186 hasAuthorship W3081657186A5015423805 @default.
- W3081657186 hasAuthorship W3081657186A5030598218 @default.
- W3081657186 hasConcept C11413529 @default.
- W3081657186 hasConcept C114614502 @default.
- W3081657186 hasConcept C118615104 @default.
- W3081657186 hasConcept C134306372 @default.
- W3081657186 hasConcept C135598885 @default.
- W3081657186 hasConcept C199360897 @default.
- W3081657186 hasConcept C33923547 @default.
- W3081657186 hasConcept C34388435 @default.
- W3081657186 hasConcept C41008148 @default.
- W3081657186 hasConcept C42747912 @default.
- W3081657186 hasConcept C77088390 @default.
- W3081657186 hasConcept C77553402 @default.
- W3081657186 hasConcept C97137487 @default.
- W3081657186 hasConceptScore W3081657186C11413529 @default.
- W3081657186 hasConceptScore W3081657186C114614502 @default.
- W3081657186 hasConceptScore W3081657186C118615104 @default.
- W3081657186 hasConceptScore W3081657186C134306372 @default.
- W3081657186 hasConceptScore W3081657186C135598885 @default.
- W3081657186 hasConceptScore W3081657186C199360897 @default.
- W3081657186 hasConceptScore W3081657186C33923547 @default.
- W3081657186 hasConceptScore W3081657186C34388435 @default.
- W3081657186 hasConceptScore W3081657186C41008148 @default.
- W3081657186 hasConceptScore W3081657186C42747912 @default.
- W3081657186 hasConceptScore W3081657186C77088390 @default.
- W3081657186 hasConceptScore W3081657186C77553402 @default.
- W3081657186 hasConceptScore W3081657186C97137487 @default.
- W3081657186 hasLocation W30816571861 @default.
- W3081657186 hasOpenAccess W3081657186 @default.
- W3081657186 hasPrimaryLocation W30816571861 @default.
- W3081657186 hasRelatedWork W1481496916 @default.
- W3081657186 hasRelatedWork W1531038000 @default.
- W3081657186 hasRelatedWork W1987681136 @default.
- W3081657186 hasRelatedWork W1995725694 @default.
- W3081657186 hasRelatedWork W2011047736 @default.
- W3081657186 hasRelatedWork W2028932986 @default.
- W3081657186 hasRelatedWork W2153715991 @default.
- W3081657186 hasRelatedWork W2400994770 @default.
- W3081657186 hasRelatedWork W2401406839 @default.
- W3081657186 hasRelatedWork W2553219432 @default.
- W3081657186 hasRelatedWork W2570609717 @default.
- W3081657186 hasRelatedWork W2607993745 @default.
- W3081657186 hasRelatedWork W2930306418 @default.
- W3081657186 hasRelatedWork W2949195484 @default.
- W3081657186 hasRelatedWork W2949412086 @default.
- W3081657186 hasRelatedWork W2982563860 @default.
- W3081657186 hasRelatedWork W3033723969 @default.
- W3081657186 hasRelatedWork W3100460727 @default.
- W3081657186 hasRelatedWork W3108592194 @default.
- W3081657186 hasRelatedWork W3128613656 @default.
- W3081657186 isParatext "false" @default.
- W3081657186 isRetracted "false" @default.
- W3081657186 magId "3081657186" @default.
- W3081657186 workType "article" @default.