File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Optimal Partitioning Which Maximizes the Weighted Sum of Products

TitleOptimal Partitioning Which Maximizes the Weighted Sum of Products
Authors
Jin, K
KeywordsGreedy algorithms
K-partition
Partitioning with additive objective
Rearrangement inequality
Sum of products
Issue Date2017
PublisherSpringer. The Proceedings' web site is located at https://link.springer.com/conference/faw
Citation
Proceedings of the 11th International Workshop on Frontiers in Algorithmics (FAW 2017), Chengdu, China, June 23-25 2017. In Xiao M., Rosamond F. (eds). Frontiers in Algorithmics. FAW 2017. Lecture Notes in Computer Science, v. 10336, p. 127-138. Cham: Springer, 2017 How to Cite?
DOI: http://dx.doi.org/10.1007/978-3-319-59605-1_12
AbstractWe consider the problem of partitioning n real numbers to K nonempty groups, so that the weighted sum of products over all groups is maximized. Our main result is an O(n^2) time algorithm for finding an optimal partition.
Persistent Identifierhttp://hdl.handle.net/10722/247691
ISBN
9783319596044
ISSN
0302-9743
2020 SCImago Journal Rankings: 0.249
ISI Accession Number ID
WOS:000454447300012
Series/Report no.Lecture Notes in Computer Science ; v. 10336

 

DC FieldValueLanguage
dc.contributor.authorJin, K-
dc.date.accessioned2017-10-18T08:31:06Z-
dc.date.available2017-10-18T08:31:06Z-
dc.date.issued2017-
dc.identifier.citationProceedings of the 11th International Workshop on Frontiers in Algorithmics (FAW 2017), Chengdu, China, June 23-25 2017. In Xiao M., Rosamond F. (eds). Frontiers in Algorithmics. FAW 2017. Lecture Notes in Computer Science, v. 10336, p. 127-138. Cham: Springer, 2017-
dc.identifier.isbn9783319596044-
dc.identifier.issn0302-9743-
dc.identifier.urihttp://hdl.handle.net/10722/247691-
dc.description.abstractWe consider the problem of partitioning n real numbers to K nonempty groups, so that the weighted sum of products over all groups is maximized. Our main result is an O(n^2) time algorithm for finding an optimal partition.-
dc.languageeng-
dc.publisherSpringer. The Proceedings' web site is located at https://link.springer.com/conference/faw-
dc.relation.ispartofFrontiers in Algorithmics (FAW17)-
dc.relation.ispartofseriesLecture Notes in Computer Science ; v. 10336-
dc.subjectGreedy algorithms-
dc.subjectK-partition-
dc.subjectPartitioning with additive objective-
dc.subjectRearrangement inequality-
dc.subjectSum of products-
dc.titleOptimal Partitioning Which Maximizes the Weighted Sum of Products-
dc.typeConference_Paper-
dc.identifier.emailJin, K: cskaijin@hku.hk-
dc.identifier.doi10.1007/978-3-319-59605-1_12-
dc.identifier.scopuseid_2-s2.0-85021775226-
dc.identifier.hkuros282117-
dc.identifier.spage127-
dc.identifier.epage138-
dc.identifier.eissn1611-3349-
dc.identifier.isiWOS:000454447300012-
dc.publisher.placeCham-
dc.identifier.issnl0302-9743-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats