相关论文: Approximating the Tutte polynomial of a binary mat…

We thoroughly study a novel but basic combinatorial matrix completion problem: Given a binary incomplete matrix, fill in the missing entries so that every pair of rows in the resulting matrix has a Hamming distance within a specified range.…

For a graph embedded into a surface, we relate many combinatorial parameters of the cycle matroid of the graph and the bond matroid of the dual graph with the topological parameters of the embedding. This will give an expression of the…

In this paper we study the MAX-CUT problem on power law graphs (PLGs) with power law exponent $\beta$. We prove some new approximability results on that problem. In particular we show that there exist polynomial time approximation schemes…

The Tutte polynomial is a well-studied invariant of matroids. The polymatroid Tutte polynomial $\mathcal{J}_{P}(x,y)$, introduced by Bernardi et al., is an extension of the classical Tutte polynomial from matroids to polymatroids $P$. In…

The main results of this paper provide an Efficient Polynomial-Time Approximation Scheme (EPTAS) for approximating the genus (and non-orientable genus) of dense graphs. By dense we mean that $|E(G)|\ge \alpha |V(G)|^2$ for some fixed…

We prove that weighted circuit satisfiability for monotone or antimonotone circuits has no fixed-parameter tractable approximation algorithm with any approximation ratio function $\rho$, unless $FPT\neq W[1]$. In particular, not having such…

We consider a problem of optimizing convex functionals over matroid bases. It is richly expressive and captures certain quadratic assignment and clustering problems. While generally NP-hard, we show it is polynomial time solvable when a…

We show that badly approximable matrices are exactly those that, for any inhomogeneous parameter, can not be inhomogeneous approximated at every monotone divergent rate, which generalizes Ram\'irez's result (2018). We also establish some…

In contrast to matroids, vf-safe delta-matroids have three kinds of minors and are closed under the operations of twist and loop complementation. We show that the delta-matroids representable over GF(4) with respect to the nontrivial…

We consider the problem of approximating the partition function of the hard-core model on planar graphs of degree at most 4. We show that when the activity lambda is sufficiently large, there is no fully polynomial randomised approximation…

We recover the Tutte polynomial of a matroid, up to change of coordinates, from an Ehrhart-style polynomial counting lattice points in the Minkowski sum of its base polytope and scalings of simplices. Our polynomial has coefficients of…

In 1977, Yu. V. Matiyasevich proposed a formula expressing the chromatic polynomial of an arbitrary graph as a linear combination of flow polynomials of subgraphs of the original graph. In this paper, we prove that this representation is a…

We develop a new framework for generalizing approximation algorithms from the structural graph algorithm literature so that they apply to graphs somewhat close to that class (a scenario we expect is common when working with real-world…

The vertex-nullity interlace polynomial of a graph, described by Arratia, Bollob\'as and Sorkin as evolving from questions of DNA sequencing, and extended to a two-variable interlace polynomial by the same authors, evokes many open…

A natural way to deal with multiple, partially conflicting objectives is turning all the objectives but one into budget constraints. Some classical polynomial-time optimization problems, such as spanning tree and forest, shortest path,…

We give a number of approximation metatheorems for monotone maximization problems expressible in the first-order logic, in substantially more general settings than the previously known. We obtain * constant-factor approximation algorithm in…

The matroid parity (or matroid matching) problem, introduced as a common generalization of matching and matroid intersection problems, is so general that it requires an exponential number of oracle calls. Nevertheless, Lov\'asz (1980)…

The multiplicity Tutte polynomial, which includes the arithmetic Tutte polynomial, is a generalization of the classical Tutte polynomial of matroids. In this paper, we obtain an expression of the general coefficient and the expressions of…

Finding a maximum cardinality common independent set in two matroids (also known as \textsc{Matroid Intersection}) is a classical combinatorial optimization problem, which generalizes several well-known problems, such as finding a maximum…

We introduce and investigate multivariate Tutte polynomials, dichromatic polynomials, subset-corank polynomials, size-corank polynomials, and rank generating polynomials of semimatroids, which generalize the corresponding polynomial…