Results 21 to 30 of about 59,986 (267)
Journal of Inequalities and Applications, 2017 Topological indices are the mathematical tools that correlate the chemical structure with various physical properties, chemical reactivity or biological activity numerically.
Muhammad Imran +3 more
doaj +1 more source
Computational Hardness of Collective Coin-Tossing Protocols
Entropy, 2020 Ben-Or and Linial, in a seminal work, introduced the full information model to study collective coin-tossing protocols. Collective coin-tossing is an elegant functionality providing uncluttered access to the primary bottlenecks to achieve security in a ...
Hemanta K. Maji
doaj +1 more source
Improving the linear relaxation of maximum k-cut with semidefinite-based constraints
EURO Journal on Computational Optimization, 2019 We consider the maximum k-cut problem that involves partitioning the vertex set of a graph into k subsets such that the sum of the weights of the edges joining vertices in different subsets is maximized.
VilmarJefté Rodrigues de Sousa +2 more
doaj +1 more source
A cutting-plane approach to the edge-weighted maximal clique problem [PDF]
, 1993 We investigated the computational performance of a cutting-plane algorithm for the problem of determining a maximal subclique in an edge-weighted complete graph.
Dijkhuizen, G. van, Faigle, U.
core +5 more sources
Combinatorial systolic inequalities
, 2015 We establish combinatorial versions of various classical systolic inequalities. For a smooth triangulation of a closed smooth manifold, the minimal number of edges in a homotopically non-trivial loop contained in the $1$-skeleton gives an integer called the combinatorial systole.
Kowalick, Ryan +2 more
openaire +2 more sources
Simplified Prophet Inequalities for Combinatorial Auctions
, 2023 We consider prophet inequalities for XOS and MPH-$k$ combinatorial auctions and give a simplified proof for the existence of static and anonymous item prices which recover the state-of-the-art competitive ratios. Our proofs make use of a linear programming formulation which has a non-negative objective value if there are prices which admit a given ...
Braun, Alexander, Kesselheim, Thomas
openaire +2 more sources
Prophet Inequalities for Subadditive Combinatorial Auctions
, 2023 In this paper, we survey literature on prophet inequalities for subadditive combinatorial auctions. We give an overview of the previous best $O(\log \log m)$ prophet inequality as well as the preceding $O(\log m)$ prophet inequality. Then, we provide the constructive posted price mechanisms used in order to prove the two bounds.
Saha, Dwaipayan, Parashar, Ananya
openaire +2 more sources
Calculus proofs of some combinatorial inequalities [PDF]
Mathematical Inequalities & Applications, 2003 Using calculus we show how to prove some combinatorial inequalities of the type log-concavity or log-convexity. It is shown by this method that binomial coefficients and Stirling numbers of the first and second kinds are log-concave, and that Motzkin numbers and secondary structure numbers of rank 1 are log-convex. In fact, we prove via calculus a much
Došlić, Tomislav, Veljan, Darko
openaire +4 more sources
A combinatorial approach to information inequalities [PDF]
Communications in Information and Systems, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Bounds on Topological Descriptors of the Corona Product of
IEEE Access, 2019 The present-day trend of the numerical coding of chemical structures with topological indices (TIs) has established quite successful in medicinal chemistry and bioinformatics.
Wei Gao +5 more
doaj +1 more source