Bibliographic Details
| Title: |
Embedding Complexity and Discrete Optimization I: A New Divide and Conquer Approach to Discrete Optimization. |
| Authors: |
Cieslik, D., Dress, A., Huber, K.T., Moulton, V. |
| Superior Title: |
Annals of Combinatorics. 2002, Vol. 6 Issue 3/4, p257. 17p. |
| Subject Terms: |
*MATHEMATICAL optimization, *EMBEDDINGS (Mathematics), *ALGEBRAIC geometry, *MATHEMATICAL analysis, *SYSTEM analysis |
| Abstract: |
In this paper, we introduce a new and quite natural way of analyzing instances of discrete optimization problems in terms of what we call the embedding complexity of an associated more or (sometimes also) less canonical embedding of the (generally vast) solution space R of a given problem into a product$ \Pi_{e \in E} P_e $$*FORMULAINSPRINGER$ of (generally many small) factor sets$ P_e (e \in E) $$*FORMULAINSPRINGER$ so that the score$ s (\pi) $$*FORMULAINSPRINGER$ of a solution$ \pi $$*FORMULAINSPRINGER$, interpreted as an element$ \pi = (\pi_e)_{e\in E} \in \Pi_{e\in E} p_e $$*FORMULAINSPRINGER$, can be computed additively by summing over the local scores$ s_e (\pi_e) $$*FORMULAINSPRINGER$ of all of its components$ \pi_e $$*FORMULAINSPRINGER$, for some appropriate score functions$ S_e (e \in E) $$*FORMULAINSPRINGER$ defined on the various factor sets [ABSTRACT FROM AUTHOR] |
|
Copyright of Annals of Combinatorics is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Academic Search Premier |