Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
On distance‐dominating and‐independent sets in sparse graphs
Z Dvořák - Journal of Graph Theory, 2019 - Wiley Online Library
Dvořák [European J. Combin. 34 (2013), pp. 833–840] gave a bound on the minimum size of
a distance‐dominating set in terms of the maximum size of a distance‐independent set and …
a distance‐dominating set in terms of the maximum size of a distance‐independent set and …
Emergence and dynamics of short food supply chains
AZ Dragicevic - Networks and Spatial Economics, 2021 - Springer
Through the consideration of a stochastic matching model dependent on a probability
function built from the Heron's formula, we analyze the emergence and the dynamics of short …
function built from the Heron's formula, we analyze the emergence and the dynamics of short …
Stochastic packing integer programs with few queries
Y Yamaguchi, T Maehara - Proceedings of the Twenty-Ninth Annual ACM …, 2018 - SIAM
We consider a stochastic variant of the packing-type integer linear programming problem,
which contains random variables in the objective vector. We are allowed to reveal each …
which contains random variables in the objective vector. We are allowed to reveal each …
Approximate multi-matroid intersection via iterative refinement
We introduce a new iterative rounding technique to round a point in a matroid polytope
subject to further matroid constraints. This technique returns an independent set in one …
subject to further matroid constraints. This technique returns an independent set in one …
Algorithms to approximate column-sparse packing problems
Column-sparse packing problems arise in several contexts in both deterministic and
stochastic discrete optimization. We present two unifying ideas,(non-uniform) attenuation …
stochastic discrete optimization. We present two unifying ideas,(non-uniform) attenuation …
Engineering Hypergraph -Matching Algorithms
E Großmann, F Joos, H Reinstädtler… - arxiv preprint arxiv …, 2024 - arxiv.org
Recently, researchers have extended the concept of matchings to the more general problem
of finding $ b $-matchings in hypergraphs broadening the scope of potential applications …
of finding $ b $-matchings in hypergraphs broadening the scope of potential applications …
Approximate multi-matroid intersection via iterative refinement
We introduce a new iterative rounding technique to round a point in a matroid polytope
subject to further matroid constraints. This technique returns an independent set in one …
subject to further matroid constraints. This technique returns an independent set in one …
Stochastic packing integer programs with few queries
We consider a stochastic variant of the packing-type integer linear programming problem,
which contains random variables in the objective vector. We are allowed to reveal each …
which contains random variables in the objective vector. We are allowed to reveal each …
Simpler and Stronger Approaches for Non-Uniform Hypergraph Matching and the Füredi, Kahn, and Seymour Conjecture∗
A well-known conjecture of Füredi, Kahn, and Seymour (1993) on non-uniform hypergraph
matching states that for any hypergraph with edge weights w, there exists a matching M such …
matching states that for any hypergraph with edge weights w, there exists a matching M such …
Stochastic packing integer programs with few queries
T Maehara, Y Yamaguchi - Proceedings of the Twenty-Ninth Annual …, 2018 - dl.acm.org
We consider a stochastic variant of the packing-type integer linear programming problem,
which contains random variables in the objective vector. We are allowed to reveal each …
which contains random variables in the objective vector. We are allowed to reveal each …