Top results
the communication complexity of approximate set packing and covering noam nisan speaker: shahar dobzinski communication complexity n players, computationally unlimited. each…
slide 1the communication complexity of approximate set packing and covering noam nisan speaker: shahar dobzinski slide 2 communication complexity n players, computationally…
on approximating four covering/packing problems bhaskar dasgupta, computer science, uic mary ashley, biological sciences, uic tanya berger-wolf, computer science, uic piotr…
19_1.tifdiscrete comput geom 4:19-40 (1989) c diserete & c~nnltmtatk~tal , eomeot finite sphere packing and sphere covering* g. fejes t6th, ~ p. gr i t zmann , 2 and
algorithms to approximate column-sparse packing problems brian brubach∗, karthik a. sankararaman†, aravind srinivasan‡, and pan xu§ department of computer science,…
noname manuscript no. will be inserted by the editor distributed algorithms for covering, packing and maximum weighted matching christos koufogiannakis · neal e. young received:…
jung hee cheon1, andrey kim1, donggeon yhee1 seoul national university, republic of korea {jhcheon, kimandrik, dark0926}@snu.ac.kr abstract. heaan is a homomorphic encryption
frank vallentin∗ sphere coverings in dimension 3 z3 overview i application to lattice problems . lattice covering problem i open ends i finite point set a ⊆ rd
by dissertation submitted in partial fulfillment of the requirements for the degree of doctor of philosophy in mathematics in the graduate college of the university of illinois
christos koufogiannakis · neal e. young received: date / accepted: date lems with submodular cost and monotone covering con- straints (submodular-cost covering). the
niv buchbinder∗ joseph (seffi) naor† abstract we study a wide range of online covering and packing optimization problems. in an online covering problem a linear
online algorithms for covering and packing problems with convex objectives niv buchbinder tel aviv university based on: paper 1: n buchbinder s chen a gupta v nagarajan j…
faster approximation algorithms for packing and covering problems∗ d. bienstock† g. iyengar‡ august 13, 2004 abstract we adapt a method proposed by nesterov 19 to design…
vol. 9 no. 2 (1986) 277-282 the packing and covering of the complete graph i: the forests of order five 277 (received september 15, 1984) abstract. the maximum number of
faster approximation algorithms for packing and covering problems∗ d. bienstock† g. iyengar‡ august 13, 2004 abstract we adapt a method proposed by nesterov 19 to design…
on approximating four covering and packing problems mary ashley∗ department of biological sciences university of illinois at chicago chicago il 60607-7053 email: ashley@uicedu…
internat. j. math. math. sci. vol. 9 no. 2 1986 277-282 the packing and covering of the complete graph i: the forests of order five 277 y. roditty school of mathematical…
2 packing and covering gábor fejes tóth introduction the basic problems in the classical theory of packings and coverings the develop- ment of which was strongly influenced…
basic genres. packing problems: set-packing, independent set. covering problems: set-cover, vertex-cover. constraint satisfaction problems: sat, 3-sat. sequencing problems:…
near-linear time approximation schemes for some implicit fractional packing problems∗ chandra chekuri kent quanrud abstract we consider several implicit fractional packing…