Matches in SemOpenAlex for { <https://semopenalex.org/work/W2000814881> ?p ?o ?g. }
Showing items 1 to 80 of
80
with 100 items per page.
- W2000814881 abstract "Abstract : In this thesis, we give efficient approximation algorithms for two classical combinatorial optimization problems: multicommodity flow problems and shop scheduling problem. The algorithms we develop for these problems yield solutions that are not necessarily optimal, but come with a provable performance guarantee; that is, we can guarantee that the solution found is within a certain percentage of the optimal solution. This type of algorithm is known as an approximation algorithm. Our results show that by allowing a small error in the solution of a problem, it is often possible to gain a significant reduction in the running time of an algorithm for that problem. In Chapter 2, we study the multicommodity flow problem. The multicommodity flow problem involves simultaneously shipping several different commodities from their respective sources to their sinks in a single network so that the total amount of flow going through each edge is no more than its capacity. Associated with each commodity is a demand, which is the amount of that commodity that we wish to ship. Given a multicommodity flow problem, one often wants to know if there is a feasible flow, i.e., if it is possible to find a flow that satisfies the demands and obeys the capacity constraints. More generally, we might wish to know the maximum percentage z such that at least z percent of each demand can be shipped without violating the capacity constraints. The latter problem is known as the concurrent flow problem. multicommodity flow, scheduling, combinatorial optimization, network algorithms, approximation algorithms, randomized algorithms." @default.
- W2000814881 created "2016-06-24" @default.
- W2000814881 creator A5054641291 @default.
- W2000814881 date "1992-01-01" @default.
- W2000814881 modified "2023-09-26" @default.
- W2000814881 title "Approximation algorithms for multicommodity flow and shop scheduling problems" @default.
- W2000814881 hasPublicationYear "1992" @default.
- W2000814881 type Work @default.
- W2000814881 sameAs 2000814881 @default.
- W2000814881 citedByCount "8" @default.
- W2000814881 countsByYear W20008148812020 @default.
- W2000814881 crossrefType "dissertation" @default.
- W2000814881 hasAuthorship W2000814881A5054641291 @default.
- W2000814881 hasConcept C111919701 @default.
- W2000814881 hasConcept C11413529 @default.
- W2000814881 hasConcept C114809511 @default.
- W2000814881 hasConcept C118615104 @default.
- W2000814881 hasConcept C126255220 @default.
- W2000814881 hasConcept C132525143 @default.
- W2000814881 hasConcept C133824558 @default.
- W2000814881 hasConcept C148764684 @default.
- W2000814881 hasConcept C157469704 @default.
- W2000814881 hasConcept C170334043 @default.
- W2000814881 hasConcept C173870130 @default.
- W2000814881 hasConcept C206729178 @default.
- W2000814881 hasConcept C22590252 @default.
- W2000814881 hasConcept C2524010 @default.
- W2000814881 hasConcept C33923547 @default.
- W2000814881 hasConcept C38349280 @default.
- W2000814881 hasConcept C41008148 @default.
- W2000814881 hasConcept C55416958 @default.
- W2000814881 hasConcept C68387754 @default.
- W2000814881 hasConcept C99545648 @default.
- W2000814881 hasConceptScore W2000814881C111919701 @default.
- W2000814881 hasConceptScore W2000814881C11413529 @default.
- W2000814881 hasConceptScore W2000814881C114809511 @default.
- W2000814881 hasConceptScore W2000814881C118615104 @default.
- W2000814881 hasConceptScore W2000814881C126255220 @default.
- W2000814881 hasConceptScore W2000814881C132525143 @default.
- W2000814881 hasConceptScore W2000814881C133824558 @default.
- W2000814881 hasConceptScore W2000814881C148764684 @default.
- W2000814881 hasConceptScore W2000814881C157469704 @default.
- W2000814881 hasConceptScore W2000814881C170334043 @default.
- W2000814881 hasConceptScore W2000814881C173870130 @default.
- W2000814881 hasConceptScore W2000814881C206729178 @default.
- W2000814881 hasConceptScore W2000814881C22590252 @default.
- W2000814881 hasConceptScore W2000814881C2524010 @default.
- W2000814881 hasConceptScore W2000814881C33923547 @default.
- W2000814881 hasConceptScore W2000814881C38349280 @default.
- W2000814881 hasConceptScore W2000814881C41008148 @default.
- W2000814881 hasConceptScore W2000814881C55416958 @default.
- W2000814881 hasConceptScore W2000814881C68387754 @default.
- W2000814881 hasConceptScore W2000814881C99545648 @default.
- W2000814881 hasLocation W20008148811 @default.
- W2000814881 hasOpenAccess W2000814881 @default.
- W2000814881 hasPrimaryLocation W20008148811 @default.
- W2000814881 hasRelatedWork W1524804355 @default.
- W2000814881 hasRelatedWork W1553098308 @default.
- W2000814881 hasRelatedWork W1579927935 @default.
- W2000814881 hasRelatedWork W1969594261 @default.
- W2000814881 hasRelatedWork W1991124379 @default.
- W2000814881 hasRelatedWork W1997272880 @default.
- W2000814881 hasRelatedWork W2002838470 @default.
- W2000814881 hasRelatedWork W2097181193 @default.
- W2000814881 hasRelatedWork W2131559541 @default.
- W2000814881 hasRelatedWork W2134200749 @default.
- W2000814881 hasRelatedWork W2134422938 @default.
- W2000814881 hasRelatedWork W2147577915 @default.
- W2000814881 hasRelatedWork W2163150343 @default.
- W2000814881 hasRelatedWork W2375348738 @default.
- W2000814881 hasRelatedWork W2513370909 @default.
- W2000814881 hasRelatedWork W2565611829 @default.
- W2000814881 hasRelatedWork W2966734597 @default.
- W2000814881 hasRelatedWork W3026096482 @default.
- W2000814881 hasRelatedWork W3124031716 @default.
- W2000814881 hasRelatedWork W65445739 @default.
- W2000814881 isParatext "false" @default.
- W2000814881 isRetracted "false" @default.
- W2000814881 magId "2000814881" @default.
- W2000814881 workType "dissertation" @default.