On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems: Approximation and Online Algorithms
Gespeichert in:
| Veröffentlicht in: | Theoretical computer science 2006, Vol.361 (2-3), p.241-256 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 256 |
|---|---|
| container_issue | 2-3 |
| container_start_page | 241 |
| container_title | Theoretical computer science |
| container_volume | 361 |
| creator | UMA, R. N WEIN, Joel WILLIAMSON, David P |
| description | |
| format | Article |
| fullrecord | <record><control><sourceid>pascalfrancis</sourceid><recordid>TN_cdi_pascalfrancis_primary_18080110</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>18080110</sourcerecordid><originalsourceid>FETCH-pascalfrancis_primary_180801103</originalsourceid><addsrcrecordid>eNqNyr9uwjAQgHELUYnw5x1u6WjJIdAkM2rVoQIGdnS2L40rx47uglDfvgw8QL_lt3wzVZRN3erttt3NVWEqs9NVW-8XainyYx7t67dCuVOCqSdgijiFnKQPI1ia7kQJXB5sSDhlDhgBk4evs7Yo5CHmOzHYfEteoMsMx7PukT2I68nfYkjfMHK2kQZZq5cOo9Dm6Uq9frxfDp96RHEYO8bkglxHDgPy77VsTGPK0lT__f4ALBxJPw</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems: Approximation and Online Algorithms</title><source>Elsevier ScienceDirect Journals Complete</source><source>EZB-FREE-00999 freely available EZB journals</source><creator>UMA, R. N ; WEIN, Joel ; WILLIAMSON, David P</creator><creatorcontrib>UMA, R. N ; WEIN, Joel ; WILLIAMSON, David P</creatorcontrib><identifier>ISSN: 0304-3975</identifier><identifier>EISSN: 1879-2294</identifier><identifier>CODEN: TCSCDI</identifier><language>eng</language><publisher>Amsterdam: Elsevier</publisher><subject>Algorithmics. Computability. Computer arithmetics ; Applied sciences ; Computer science; control theory; systems ; Computer systems performance. Reliability ; Exact sciences and technology ; Mathematical programming ; Operational research and scientific management ; Operational research. Management science ; Software ; Theoretical computing</subject><ispartof>Theoretical computer science, 2006, Vol.361 (2-3), p.241-256</ispartof><rights>2006 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,4024</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=18080110$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>UMA, R. N</creatorcontrib><creatorcontrib>WEIN, Joel</creatorcontrib><creatorcontrib>WILLIAMSON, David P</creatorcontrib><title>On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems: Approximation and Online Algorithms</title><title>Theoretical computer science</title><subject>Algorithmics. Computability. Computer arithmetics</subject><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Computer systems performance. Reliability</subject><subject>Exact sciences and technology</subject><subject>Mathematical programming</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Software</subject><subject>Theoretical computing</subject><issn>0304-3975</issn><issn>1879-2294</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2006</creationdate><recordtype>article</recordtype><recordid>eNqNyr9uwjAQgHELUYnw5x1u6WjJIdAkM2rVoQIGdnS2L40rx47uglDfvgw8QL_lt3wzVZRN3erttt3NVWEqs9NVW-8XainyYx7t67dCuVOCqSdgijiFnKQPI1ia7kQJXB5sSDhlDhgBk4evs7Yo5CHmOzHYfEteoMsMx7PukT2I68nfYkjfMHK2kQZZq5cOo9Dm6Uq9frxfDp96RHEYO8bkglxHDgPy77VsTGPK0lT__f4ALBxJPw</recordid><startdate>2006</startdate><enddate>2006</enddate><creator>UMA, R. N</creator><creator>WEIN, Joel</creator><creator>WILLIAMSON, David P</creator><general>Elsevier</general><scope>IQODW</scope></search><sort><creationdate>2006</creationdate><title>On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems</title><author>UMA, R. N ; WEIN, Joel ; WILLIAMSON, David P</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-pascalfrancis_primary_180801103</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Algorithmics. Computability. Computer arithmetics</topic><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Computer systems performance. Reliability</topic><topic>Exact sciences and technology</topic><topic>Mathematical programming</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Software</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>UMA, R. N</creatorcontrib><creatorcontrib>WEIN, Joel</creatorcontrib><creatorcontrib>WILLIAMSON, David P</creatorcontrib><collection>Pascal-Francis</collection><jtitle>Theoretical computer science</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>UMA, R. N</au><au>WEIN, Joel</au><au>WILLIAMSON, David P</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems: Approximation and Online Algorithms</atitle><jtitle>Theoretical computer science</jtitle><date>2006</date><risdate>2006</risdate><volume>361</volume><issue>2-3</issue><spage>241</spage><epage>256</epage><pages>241-256</pages><issn>0304-3975</issn><eissn>1879-2294</eissn><coden>TCSCDI</coden><cop>Amsterdam</cop><pub>Elsevier</pub></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0304-3975 |
| ispartof | Theoretical computer science, 2006, Vol.361 (2-3), p.241-256 |
| issn | 0304-3975 1879-2294 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_18080110 |
| source | Elsevier ScienceDirect Journals Complete; EZB-FREE-00999 freely available EZB journals |
| subjects | Algorithmics. Computability. Computer arithmetics Applied sciences Computer science control theory systems Computer systems performance. Reliability Exact sciences and technology Mathematical programming Operational research and scientific management Operational research. Management science Software Theoretical computing |
| title | On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems: Approximation and Online Algorithms |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-28T22%3A34%3A09IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=On%20the%20relationship%20between%20combinatorial%20and%20LP-based%20lower%20bounds%20for%20NP-hard%20scheduling%20problems:%20Approximation%20and%20Online%20Algorithms&rft.jtitle=Theoretical%20computer%20science&rft.au=UMA,%20R.%20N&rft.date=2006&rft.volume=361&rft.issue=2-3&rft.spage=241&rft.epage=256&rft.pages=241-256&rft.issn=0304-3975&rft.eissn=1879-2294&rft.coden=TCSCDI&rft_id=info:doi/&rft_dat=%3Cpascalfrancis%3E18080110%3C/pascalfrancis%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |