Add to ORKGInternational audienceWe study the total weight of weighted matchings in segment graphs, which is related to a question concerning generalized Chebyshev polynomials introduced by Vauchassade de Chaumont and Viennot and, more recently, investigated by Kim and Zeng. We prove that weighted matchings with sufficiently large node-weight cannot have equal total weight
Approximation algorithms have so far mainly been studied for problems that are not known to have pol...
We show that for any $k$ there is a polynomial time algorithm to evaluate the weighted graph polynom...
. A new approximation algorithm for maximum weighted matching in general edge-weighted graphs is pre...
International audienceWe study the total weight of weighted matchings in segment graphs, which is re...
Let G be an undirected bipartite graph with positive integer weights on the edges. We refine the exi...
We reduce the best known approximation ratio for finding a weighted matching of a graph using a o...
Abstract. In this paper, we present fast and fully distributed algorithms for matching in weighted t...
AbstractIt is shown that in a 0-sum Boolean weighted graph G the sum of the weights taken over all t...
We revisit the classical maximum weight matching problem in general graphs with nonnegative integral...
AbstractWe enumerate weighted simple graphs with a natural upper bound condition on the sum of the w...
Given a set of vertices V with |V| = n, a weight vector w in (R^+ cup {0})^{binom{V}{2}}, and a prob...
Wattenhofer et al. [WW04] derive a complicated distributed algorithm to compute a weighted matching ...
We present a (4 + epsilon) approximation algorithm for weighted graph matching which applies in the ...
AbstractA matching of a graph G is a spanning subgraph of G in which every component is either a nod...
We consider the maximum weight $b$-matching problem in the random-order semi-streaming model. Assumi...
Approximation algorithms have so far mainly been studied for problems that are not known to have pol...
We show that for any $k$ there is a polynomial time algorithm to evaluate the weighted graph polynom...
. A new approximation algorithm for maximum weighted matching in general edge-weighted graphs is pre...
International audienceWe study the total weight of weighted matchings in segment graphs, which is re...
Let G be an undirected bipartite graph with positive integer weights on the edges. We refine the exi...
We reduce the best known approximation ratio for finding a weighted matching of a graph using a o...
Abstract. In this paper, we present fast and fully distributed algorithms for matching in weighted t...
AbstractIt is shown that in a 0-sum Boolean weighted graph G the sum of the weights taken over all t...
We revisit the classical maximum weight matching problem in general graphs with nonnegative integral...
AbstractWe enumerate weighted simple graphs with a natural upper bound condition on the sum of the w...
Given a set of vertices V with |V| = n, a weight vector w in (R^+ cup {0})^{binom{V}{2}}, and a prob...
Wattenhofer et al. [WW04] derive a complicated distributed algorithm to compute a weighted matching ...
We present a (4 + epsilon) approximation algorithm for weighted graph matching which applies in the ...
AbstractA matching of a graph G is a spanning subgraph of G in which every component is either a nod...
We consider the maximum weight $b$-matching problem in the random-order semi-streaming model. Assumi...
Approximation algorithms have so far mainly been studied for problems that are not known to have pol...
We show that for any $k$ there is a polynomial time algorithm to evaluate the weighted graph polynom...
. A new approximation algorithm for maximum weighted matching in general edge-weighted graphs is pre...