FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W3104014928> ?p ?o ?g. }

• W3104014928 abstract "Suppose that finding the solution to a problem is P-complete. It is natural to ask if it is any easier to obtain an approximate solution. For decision problems this might mean considering the corresponding combinatorial optimization problem. That is, a problem in which we try to minimize or maximize a given quantity. As one might expect from the theory of NP-completeness, the answer is both yes (for example in the case of Bin Packing, Problem A.4.7) and no (for example in the case of the Lexicographically First Maximal Independent Set Size Problem, see Lemma 10.2.2.). There are several motivations for developing good NC approximation algorithms. First, in all likelihood P-complete problems cannot be solved fast in parallel. Therefore, it may be useful to approximate them quickly in parallel. Second, problems that are P- complete but that can be approximated well seem to be special boundary cases. Perhaps by examining these types of problems more closely we can improve our understanding of parallelism. Third, it is important to build a theoretical foundation for studying and classifying additional approximation problems. Finally, it may be possible to speed up sequential approximation algorithms, of NP-complete problems, using fast parallel approximations. Our goal in this section is to develop the basic theory of parallel approximation algorithms. We begin by showing that certain P-complete problems are not amenable to NC approximation algorithms. Later we present examples of P-complete problems that can be approximated well in parallel. We start by considering the Lexicographically First Maximal Independent Set Problem, introduced in Definition 7.1.1, and proven P-complete in Problem A.2.1. As defined, LFMIS it is not directly amenable to approximation. We can phrase the problem in terms of computing the size of the independent set. Definition 10.2.1 Lexicographically First Maximal Independent Set Size (LFMISsize) Given: An undirected graph G = (V, E) with an ordering on the vertices and an integer k. Problem: Is the size of the lexicographically first maximal independent set of G less than or equal to k ? The following lemma shows that computing just the size of the lexicographically first maximal independent set is P-complete." @default.
• W3104014928 created "2020-11-23" @default.
• W3104014928 creator A5043885349 @default.
• W3104014928 creator A5066858573 @default.
• W3104014928 creator A5072955307 @default.
• W3104014928 date "1995-06-01" @default.
• W3104014928 modified "2023-09-25" @default.
• W3104014928 title "Approximating P-Complete Problems" @default.
• W3104014928 doi "https://doi.org/10.1093/oso/9780195085914.003.0014" @default.
• W3104014928 hasPublicationYear "1995" @default.
• W3104014928 type Work @default.
• W3104014928 sameAs 3104014928 @default.
• W3104014928 citedByCount "0" @default.
• W3104014928 crossrefType "book-chapter" @default.
• W3104014928 hasAuthorship W3104014928A5043885349 @default.
• W3104014928 hasAuthorship W3104014928A5066858573 @default.
• W3104014928 hasAuthorship W3104014928A5072955307 @default.
• W3104014928 hasConcept C11413529 @default.
• W3104014928 hasConcept C114614502 @default.
• W3104014928 hasConcept C118615104 @default.
• W3104014928 hasConcept C126255220 @default.
• W3104014928 hasConcept C148764684 @default.
• W3104014928 hasConcept C159254197 @default.
• W3104014928 hasConcept C177264268 @default.
• W3104014928 hasConcept C18903297 @default.
• W3104014928 hasConcept C19754495 @default.
• W3104014928 hasConcept C199360897 @default.
• W3104014928 hasConcept C2777759810 @default.
• W3104014928 hasConcept C33923547 @default.
• W3104014928 hasConcept C41008148 @default.
• W3104014928 hasConcept C46757340 @default.
• W3104014928 hasConcept C86803240 @default.
• W3104014928 hasConceptScore W3104014928C11413529 @default.
• W3104014928 hasConceptScore W3104014928C114614502 @default.
• W3104014928 hasConceptScore W3104014928C118615104 @default.
• W3104014928 hasConceptScore W3104014928C126255220 @default.
• W3104014928 hasConceptScore W3104014928C148764684 @default.
• W3104014928 hasConceptScore W3104014928C159254197 @default.
• W3104014928 hasConceptScore W3104014928C177264268 @default.
• W3104014928 hasConceptScore W3104014928C18903297 @default.
• W3104014928 hasConceptScore W3104014928C19754495 @default.
• W3104014928 hasConceptScore W3104014928C199360897 @default.
• W3104014928 hasConceptScore W3104014928C2777759810 @default.
• W3104014928 hasConceptScore W3104014928C33923547 @default.
• W3104014928 hasConceptScore W3104014928C41008148 @default.
• W3104014928 hasConceptScore W3104014928C46757340 @default.
• W3104014928 hasConceptScore W3104014928C86803240 @default.
• W3104014928 hasLocation W31040149281 @default.
• W3104014928 hasOpenAccess W3104014928 @default.
• W3104014928 hasPrimaryLocation W31040149281 @default.
• W3104014928 hasRelatedWork W1452987818 @default.
• W3104014928 hasRelatedWork W1510455279 @default.
• W3104014928 hasRelatedWork W2012276582 @default.
• W3104014928 hasRelatedWork W2021294212 @default.
• W3104014928 hasRelatedWork W2030387300 @default.
• W3104014928 hasRelatedWork W2143382256 @default.
• W3104014928 hasRelatedWork W2156487206 @default.
• W3104014928 hasRelatedWork W2799781558 @default.
• W3104014928 hasRelatedWork W2808390993 @default.
• W3104014928 hasRelatedWork W2953247147 @default.
• W3104014928 isParatext "false" @default.
• W3104014928 isRetracted "false" @default.
• W3104014928 magId "3104014928" @default.
• W3104014928 workType "book-chapter" @default.