Imagen de Portada

A New and Faster Representation for Counting Integer Points in Parametric Polyhedra

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Gribanov, D., Malyshev, D., Pardalos, P., Zolotykh, N.
Formato:	Preprint
Publicado:	2023
Materias:	Data Structures and Algorithms Computational Geometry Discrete Mathematics Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Hyperplanes Avoiding Problem and Integer Points Counting in Polyhedra
por: Dakhno, Grigorii, et al.
Publicado: (2024)

Faster Algorithms for Sparse ILP and Hypergraph Multi-Packing/Multi-Cover Problems
por: Gribanov, Dmitry, et al.
Publicado: (2022)

Efficient Algorithms and Implementations for Extracting Maximum-Size $(k,\ell)$-Sparse Subgraphs
por: Madarasi, Péter
Publicado: (2025)

Implicit representations via the polynomial method
por: Cardinal, Jean, et al.
Publicado: (2026)

Quadratic-Time Algorithm for the Maximum-Weight $(k, \ell)$-Sparse Subgraph Problem
por: Deák, Bence, et al.
Publicado: (2025)

Computational Verification of the Buratti--Horak--Rosa Conjecture for Small Integers and Inductive Approaches
por: Naik, Ranjan N
Publicado: (2025)

A Faster Deterministic Algorithm for Mader's $\mathcal{S}$-Path Packing
por: Iwata, Satoru, et al.
Publicado: (2024)

O(1)-Distortion Planar Emulators for String Graphs
por: Chang, Hsien-Chih, et al.
Publicado: (2025)

The Squishy Grid Problem
por: Cai, Zixi, et al.
Publicado: (2025)

Flip Distance of Triangulations of Convex Polygons / Rotation Distance of Binary Trees is NP-complete
por: Dorfer, Joseph
Publicado: (2026)

Matrix Scaling: a New Heuristic for the Feedback Vertex Set Problem
por: Shook, James M., et al.
Publicado: (2025)

A Faster Isomorphism Test for Graphs of Small Degree
por: Grohe, Martin, et al.
Publicado: (2018)

Deterministic approximation for the volume of the truncated fractional matching polytope
por: Guo, Heng, et al.
Publicado: (2024)

A Uniformly Random Solution to Algorithmic Redistricting
por: Cai, Jin-Yi, et al.
Publicado: (2024)

The Simultaneous Interval Number: A New Width Parameter that Measures the Similarity to Interval Graphs
por: Beisegel, Jesse, et al.
Publicado: (2024)

Upward Pointset Embeddings of Planar st-Graphs
por: Alegria, Carlos, et al.
Publicado: (2024)

Integer programs with bounded subdeterminants and two nonzeros per row
por: Fiorini, Samuel, et al.
Publicado: (2021)

Integer programs with nearly totally unimodular matrices: the cographic case
por: Aprile, Manuel, et al.
Publicado: (2024)

The Four Color Theorem with Linearly Many Reducible Configurations and Near-Linear Time Coloring
por: Inoue, Yuta, et al.
Publicado: (2026)

Unbent Collections of Orthogonal Drawings
por: Antić, Todor, et al.
Publicado: (2025)

On the Vertices of Delta-modular Polyhedra
por: Mikhail, Bludov, et al.
Publicado: (2025)

A characterization of testable hypergraph properties
por: Joos, Felix, et al.
Publicado: (2017)

A logarithmic approximation of linearly ordered colourings
por: Håstad, Johan, et al.
Publicado: (2024)

A Polynomial-Time Approximation Algorithm for Complete Interval Minors
por: Bourneuf, Romain, et al.
Publicado: (2025)

A Structural Linear-Time Algorithm for Computing the Tutte Decomposition
por: Bourneuf, Romain, et al.
Publicado: (2025)

A Quadratic Vertex Kernel and a Subexponential Algorithm for Subset-FAST
por: Jana, Satyabrata, et al.
Publicado: (2025)

A linear-time algorithm for $(1+ε)Δ$-edge-coloring
por: Bernshteyn, Anton, et al.
Publicado: (2024)

A Polynomial Coreset for Furthest Neighbor in Planar Metrics
por: Kluk, Kacper, et al.
Publicado: (2026)

A Fast Algorithm for Finding Minimum Weight Cycles in Mining Cyclic Graph Topologies
por: Shakeri, Heman, et al.
Publicado: (2025)

A new width parameter of graphs based on edge cuts: $α$-edge-crossing width
por: Chang, Yeonsu, et al.
Publicado: (2023)

A Practical Algorithm with Performance Guarantees for the Art Gallery Problem
por: Hengeveld, Simon, et al.
Publicado: (2020)

A Near-Linear-Time Algorithm for Finding a Well-Spread Perfect Matching in Bridgeless Cubic Graphs
por: Ghanbari, Babak, et al.
Publicado: (2026)

Reweighted Spectral Partitioning Works: A Simple Algorithm for Vertex Separators in Special Graph Classes
por: Spalding-Jamieson, Jack
Publicado: (2025)

Hypergraph dualization with FPT-delay parameterized by the degeneracy and dimension
por: Bartier, Valentin, et al.
Publicado: (2023)

On The Maximum Linear Arrangement Problem for Trees
por: Alemany-Puig, Lluís, et al.
Publicado: (2023)

Sampling Balanced Forests of Grids in Polynomial Time
por: Cannon, Sarah, et al.
Publicado: (2023)

Perturbation results for distance-edge-monitoring numbers
por: Yang, Chenxu, et al.
Publicado: (2023)

Enumerating minimal solution sets for metric graph problems
por: Bergougnoux, Benjamin, et al.
Publicado: (2023)

An Algebraic Approach to the Longest Path Problem
por: Khazali, Omar Al -
Publicado: (2023)

An Alternate Proof of Near-Optimal Light Spanners
por: Bodwin, Greg
Publicado: (2023)