Fast approximation algorithms for fractional packing and covering problems
Fast algorithms that find approximate solutions for a general class of problems, which are called fractional packing and covering problems, are presented. The only previously known algorithms for solving these problems are based on general linear programming techniques. The techniques developed grea...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 504 |
|---|---|
| container_issue | |
| container_start_page | 495 |
| container_title | |
| container_volume | |
| creator | Plotkin, S.A. Shmoys, D.B. Tardos, E. |
| description | Fast algorithms that find approximate solutions for a general class of problems, which are called fractional packing and covering problems, are presented. The only previously known algorithms for solving these problems are based on general linear programming techniques. The techniques developed greatly outperform the general methods in many applications, and are extensions of a method previously applied to find approximate solutions to multicommodity flow problems. The algorithms are based on a Lagrangian relaxation technique, and an important result is a theoretical analysis of the running time of a Lagrangian relaxation based algorithm. Several applications of the algorithms are presented.< > |
| doi_str_mv | 10.1109/SFCS.1991.185411 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_185411</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>185411</ieee_id><sourcerecordid>185411</sourcerecordid><originalsourceid>FETCH-LOGICAL-i280t-c70cdbcc37ae4567bde7605c8f327731265218fc1d3c2fd9aa7a653a83fd3c763</originalsourceid><addsrcrecordid>eNotT0tLxDAYDIiwuu5dPOUPtOZLmkePUqwPFjyse16-pska7YukiP57u6xzGWZghhlCboHlAKy839XVLoeyhByMLAAuyDUzYBQvCslWZJPSJ1sgpRG8uCKvNaaZ4jTF8Sf0OIdxoNgdxxjmjz5RP0bqI9qTjx2d0H6F4UhxaKkdv108iSXadK5PN-TSY5fc5p_XZF8_vlfP2fbt6aV62GaBGzZnVjPbNtYKja6QSjet04pJa7zgWgvgSnIw3kIrLPdtiahRSYFG-MXRSqzJ3bk3OOcOU1xmx9_D-a34A3ufTBs</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Fast approximation algorithms for fractional packing and covering problems</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Plotkin, S.A. ; Shmoys, D.B. ; Tardos, E.</creator><creatorcontrib>Plotkin, S.A. ; Shmoys, D.B. ; Tardos, E.</creatorcontrib><description>Fast algorithms that find approximate solutions for a general class of problems, which are called fractional packing and covering problems, are presented. The only previously known algorithms for solving these problems are based on general linear programming techniques. The techniques developed greatly outperform the general methods in many applications, and are extensions of a method previously applied to find approximate solutions to multicommodity flow problems. The algorithms are based on a Lagrangian relaxation technique, and an important result is a theoretical analysis of the running time of a Lagrangian relaxation based algorithm. Several applications of the algorithms are presented.< ></description><identifier>ISBN: 0818624450</identifier><identifier>ISBN: 9780818624452</identifier><identifier>DOI: 10.1109/SFCS.1991.185411</identifier><language>eng</language><publisher>IEEE Comput. Soc. Press</publisher><subject>Algorithm design and analysis ; Approximation algorithms ; Contracts ; Cost function ; Job shop scheduling ; Lagrangian functions ; Linear programming ; Parallel machines ; Sun ; Uninterruptible power systems</subject><ispartof>[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science, 1991, p.495-504</ispartof><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/185411$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,27902,54895</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/185411$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Plotkin, S.A.</creatorcontrib><creatorcontrib>Shmoys, D.B.</creatorcontrib><creatorcontrib>Tardos, E.</creatorcontrib><title>Fast approximation algorithms for fractional packing and covering problems</title><title>[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science</title><addtitle>SFCS</addtitle><description>Fast algorithms that find approximate solutions for a general class of problems, which are called fractional packing and covering problems, are presented. The only previously known algorithms for solving these problems are based on general linear programming techniques. The techniques developed greatly outperform the general methods in many applications, and are extensions of a method previously applied to find approximate solutions to multicommodity flow problems. The algorithms are based on a Lagrangian relaxation technique, and an important result is a theoretical analysis of the running time of a Lagrangian relaxation based algorithm. Several applications of the algorithms are presented.< ></description><subject>Algorithm design and analysis</subject><subject>Approximation algorithms</subject><subject>Contracts</subject><subject>Cost function</subject><subject>Job shop scheduling</subject><subject>Lagrangian functions</subject><subject>Linear programming</subject><subject>Parallel machines</subject><subject>Sun</subject><subject>Uninterruptible power systems</subject><isbn>0818624450</isbn><isbn>9780818624452</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>1991</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotT0tLxDAYDIiwuu5dPOUPtOZLmkePUqwPFjyse16-pska7YukiP57u6xzGWZghhlCboHlAKy839XVLoeyhByMLAAuyDUzYBQvCslWZJPSJ1sgpRG8uCKvNaaZ4jTF8Sf0OIdxoNgdxxjmjz5RP0bqI9qTjx2d0H6F4UhxaKkdv108iSXadK5PN-TSY5fc5p_XZF8_vlfP2fbt6aV62GaBGzZnVjPbNtYKja6QSjet04pJa7zgWgvgSnIw3kIrLPdtiahRSYFG-MXRSqzJ3bk3OOcOU1xmx9_D-a34A3ufTBs</recordid><startdate>19910101</startdate><enddate>19910101</enddate><creator>Plotkin, S.A.</creator><creator>Shmoys, D.B.</creator><creator>Tardos, E.</creator><general>IEEE Comput. Soc. Press</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>19910101</creationdate><title>Fast approximation algorithms for fractional packing and covering problems</title><author>Plotkin, S.A. ; Shmoys, D.B. ; Tardos, E.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i280t-c70cdbcc37ae4567bde7605c8f327731265218fc1d3c2fd9aa7a653a83fd3c763</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>1991</creationdate><topic>Algorithm design and analysis</topic><topic>Approximation algorithms</topic><topic>Contracts</topic><topic>Cost function</topic><topic>Job shop scheduling</topic><topic>Lagrangian functions</topic><topic>Linear programming</topic><topic>Parallel machines</topic><topic>Sun</topic><topic>Uninterruptible power systems</topic><toplevel>online_resources</toplevel><creatorcontrib>Plotkin, S.A.</creatorcontrib><creatorcontrib>Shmoys, D.B.</creatorcontrib><creatorcontrib>Tardos, E.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Xplore</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Plotkin, S.A.</au><au>Shmoys, D.B.</au><au>Tardos, E.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Fast approximation algorithms for fractional packing and covering problems</atitle><btitle>[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science</btitle><stitle>SFCS</stitle><date>1991-01-01</date><risdate>1991</risdate><spage>495</spage><epage>504</epage><pages>495-504</pages><isbn>0818624450</isbn><isbn>9780818624452</isbn><abstract>Fast algorithms that find approximate solutions for a general class of problems, which are called fractional packing and covering problems, are presented. The only previously known algorithms for solving these problems are based on general linear programming techniques. The techniques developed greatly outperform the general methods in many applications, and are extensions of a method previously applied to find approximate solutions to multicommodity flow problems. The algorithms are based on a Lagrangian relaxation technique, and an important result is a theoretical analysis of the running time of a Lagrangian relaxation based algorithm. Several applications of the algorithms are presented.< ></abstract><pub>IEEE Comput. Soc. Press</pub><doi>10.1109/SFCS.1991.185411</doi><tpages>10</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISBN: 0818624450 |
| ispartof | [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science, 1991, p.495-504 |
| issn | |
| language | eng |
| recordid | cdi_ieee_primary_185411 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Algorithm design and analysis Approximation algorithms Contracts Cost function Job shop scheduling Lagrangian functions Linear programming Parallel machines Sun Uninterruptible power systems |
| title | Fast approximation algorithms for fractional packing and covering problems |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-29T03%3A38%3A08IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Fast%20approximation%20algorithms%20for%20fractional%20packing%20and%20covering%20problems&rft.btitle=%5B1991%5D%20Proceedings%2032nd%20Annual%20Symposium%20of%20Foundations%20of%20Computer%20Science&rft.au=Plotkin,%20S.A.&rft.date=1991-01-01&rft.spage=495&rft.epage=504&rft.pages=495-504&rft.isbn=0818624450&rft.isbn_list=9780818624452&rft_id=info:doi/10.1109/SFCS.1991.185411&rft_dat=%3Cieee_6IE%3E185411%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=185411&rfr_iscdi=true |