Multiple knapsack-constrained monotone DR-submodular maximization on distributive lattice

2021 ◽  
Author(s):  
Takanori Maehara ◽  
So Nakashima ◽  
Yutaro Yamaguchi
Keyword(s):  
Distributive Lattice ◽  
Multiple Knapsack ◽  
Submodular Maximization

The Wire-Speed Multicast Switch Fabric Based on Distributive Lattice

2014 ◽  
Vol E97.B (7) ◽  
pp. 1385-1394 ◽  
Author(s):  
Fuxing CHEN ◽  
Weiyang LIU ◽  
Hui LI ◽  
Dongcheng WU
Keyword(s):  
Distributive Lattice ◽  
Switch Fabric ◽  
The Wire

scholarly journals Revisiting Modified Greedy Algorithm for Monotone Submodular Maximization with a Knapsack Constraint

2021 ◽  
Vol 5 (1) ◽  
pp. 1-22
Author(s):  
Jing Tang ◽  
Xueyan Tang ◽  
Andrew Lim ◽  
Kai Han ◽  
Chongshou Li ◽  
...  
Keyword(s):  
Approximation Algorithms ◽  
Greedy Algorithm ◽  
Branch And Bound ◽  
Upper Bound ◽  
Optimization Problem ◽  
Approximation Factor ◽  
Real World Application ◽  
Efficiency Of Algorithms ◽  
Knapsack Constraint ◽  
Submodular Maximization

Monotone submodular maximization with a knapsack constraint is NP-hard. Various approximation algorithms have been devised to address this optimization problem. In this paper, we revisit the widely known modified greedy algorithm. First, we show that this algorithm can achieve an approximation factor of 0.405, which significantly improves the known factors of 0.357 given by Wolsey and (1-1/e)/2\approx 0.316 given by Khuller et al. More importantly, our analysis closes a gap in Khuller et al.'s proof for the extensively mentioned approximation factor of (1-1/\sqrte )\approx 0.393 in the literature to clarify a long-standing misconception on this issue. Second, we enhance the modified greedy algorithm to derive a data-dependent upper bound on the optimum. We empirically demonstrate the tightness of our upper bound with a real-world application. The bound enables us to obtain a data-dependent ratio typically much higher than 0.405 between the solution value of the modified greedy algorithm and the optimum. It can also be used to significantly improve the efficiency of algorithms such as branch and bound.

Congruence relations on almost distributive lattices-II

2019 ◽  
pp. 2150005
Author(s):  
Gezahagne Mulat Addis
Keyword(s):  
Distributive Lattice ◽  
Congruence Relation ◽  
Congruence Class ◽  
Distributive Lattices ◽  
Ideal Formula ◽  
Congruence Relations

For a given ideal [Formula: see text] of an almost distributive lattice [Formula: see text], we study the smallest and the largest congruence relation on [Formula: see text] having [Formula: see text] as a congruence class.

scholarly journals Subdirect products of semirings

2001 ◽  
Vol 26 (9) ◽  
pp. 539-545
Author(s):  
P. Mukhopadhyay
Keyword(s):  
Distributive Lattice ◽  
Subdirect Product ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Subdirect Products ◽  
Necessary And Sufficient

Bandelt and Petrich (1982) proved that an inversive semiringSis a subdirect product of a distributive lattice and a ring if and only ifSsatisfies certain conditions. The aim of this paper is to obtain a generalized version of this result. The main purpose of this paper however, is to investigate, what new necessary and sufficient conditions need we impose on an inversive semiring, so that, in its aforesaid representation as a subdirect product, the “ring” involved can be gradually enriched to a “field.” Finally, we provide a construction of fullE-inversive semirings, which are subdirect products of a semilattice and a ring.

Sign in / Sign up

Export Citation Format

Share Document