反馈文件质量
lgli/Cs_Computer science/CsLn_Lecture notes/A/Approximation Algorithms for Combinatorial Optimization, APPROX'98(LNCS1444, Springer, 1998)(ISBN 3540647368)(205s).pdf
Approximation Algorithms for Combinatiorial Optimization: International Workshop APPROX'98 Aalborg, Denmark, July 18–19, 1998 Proceedings 🔍
MagnÚs M. Halldórsson (auth.), Klaus Jansen, José Rolim (eds.) Springer-Verlag Berlin Heidelberg, Lecture Notes in Computer Science, Lecture Notes in Computer Science 1444, 1, 1998
英语 [en] · PDF · 1.7MB · 1998 · 📘 非小说类图书 · 🚀/lgli/lgrs/nexusstc/zlib · Save
描述
This book constitutes the refereed proceedings of the International Workshop on Approximation Algorithms for Combinatorical Optimization, APPROX'98, held in conjunction with ICALP'98 in Aalborg, Denmark, in July 1998.
The volume presents 14 revised full papers together with three invited papers selected from 37 submissions. The papers address the design and analysis of approximation algorithms, inapproximability results, on-line problems, randomization techniques, average-case analysis, approximation classes, scheduling problems, routing and flow problems, coloring and partitioning, cuts and connectivity, packing and covering, geometric problems, network design, and various applications.
备用文件名
lgrsnf/Cs_Computer science/CsLn_Lecture notes/A/Approximation Algorithms for Combinatorial Optimization, APPROX'98(LNCS1444, Springer, 1998)(ISBN 3540647368)(205s).pdf
备用文件名
nexusstc/Approximation Algorithms for Combinatiorial Optimization: International Workshop APPROX'98 Aalborg, Denmark, July 18–19, 1998 Proceedings/4489c5ef1830c4b608c67bfd74b3ec6b.pdf
备用文件名
zlib/Mathematics/MagnÚs M. Halldórsson (auth.), Klaus Jansen, José Rolim (eds.)/Approximation Algorithms for Combinatiorial Optimization: International Workshop APPROX'98 Aalborg, Denmark, July 18–19, 1998 Proceedings_572410.pdf
备选标题
Approximation Algorithms For Combinatorial Optimization: International Workshop Approx'98, Aalborg, Denmark, July 18-19, 1998, Proceedings (lecture Notes In Computer Science)
备选标题
Approximation algorithms for combinatorial optimization : international workshop, APPROX '98, Aalborg, Denmark, July 18-19, 1998 : proceedings
备选作者
International Workshop On Approximation Algorithms For Combinatorial Optimization Problems (1998 : Aalborg, Denmark), Jansen, Klaus., Rolim, José D. P.
备选作者
Klaus Jansen; José Rolim; International Workshop APPROX '98
备选作者
Klaus Jansen; José D. P Rolim
备选作者
Klaus Jansen, Jose Rolim
备用出版商
Springer Berlin Heidelberg : Imprint: Springer
备用出版商
Springer Spektrum. in Springer-Verlag GmbH
备用出版商
Steinkopff. in Springer-Verlag GmbH
备用出版商
SpringerLink [host
备用版本
Lecture notes in computer science, 1444, 1st ed. 1998, Berlin, Heidelberg, 1998
备用版本
Lecture notes in computer science,, 1444, Berlin, New York, Germany, 1998
备用版本
Lecture notes in computer science, Berlin [etc, 1998
备用版本
1 edition, August 13, 1998
备用版本
Germany, Germany
备用版本
2003
元数据中的注释
Kolxo3 -- 2009 new
元数据中的注释
lg944570
元数据中的注释
{"container_title":"Lecture Notes in Computer Science","edition":"1","isbns":["3540647368","3540690670","9783540647362","9783540690672"],"issns":["0302-9743","1611-3349"],"last_page":207,"publisher":"Springer","series":"Lecture Notes in Computer Science 1444"}
元数据中的注释
Includes bibliographical references and index.
Selected papers from APPROX '98, held July 18-19, 1998, University of Aalborg, Denmark, in conjunction with ICALP '98.
备用描述
Approximations of independent sets in graphs....Pages 1-13
Using linear programming in the design and analysis of approximation algorithms: Two illustrative problems....Pages 15-32
The Steiner tree problem and its generalizations....Pages 33-38
Approximation schemes for covering and scheduling in related machines....Pages 39-47
One for the price of two: A unified approach for approximating covering problems....Pages 49-62
Approximation of geometric dispersion problems....Pages 63-75
Approximating k -outconnected subgraph problems....Pages 77-88
Lower bounds for on-line scheduling with precedence constraints on identical machines....Pages 89-98
Instant recognition of half integrality and 2-approximations....Pages 99-110
The t -vertex cover problem: Extending the half integrality framework with budget constraints....Pages 111-122
A new fully polynomial approximation scheme for the knapsack problem....Pages 123-134
On the hardness of approximating spanners....Pages 135-146
Approximating circular arc colouring and bandwidth allocation in all-optical ring networks....Pages 147-158
Approximating maximum independent set in k-clique-free graphs....Pages 159-168
Approximating an interval scheduling problem....Pages 169-180
Finding dense subgraphs with semidefinite programming....Pages 181-191
Best possible approximation algorithm for MAX SAT with cardinality constraint....Pages 193-199
备用描述
<p><P>This book constitutes the refereed proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2000, held in Saarbr&#252;cken, Germany in September 2000. The 22 revised full papers presented together with four invited contributions were carefully reviewed and selected from 68 submissions. The topics dealt with include design and analysis of approximation algorithms, inapproximibility results, on-line problems, randomization techniques, average-case analysis, approximation classes, scheduling problems, routing and flow problems, coloring and partitioning, cuts and connectivity, packing and covering, geometric problems, network design, and various applications.</p>
备用描述
A volume of 17 papers from a workshop on approximation algorithms for combinatorial optimization. They address the design and analysis of approximation algorithms, inapproximability results, on-line problems, randomization techniques, average-case analysis, scheduling problems, and applications.
备用描述
Selected papers from APPROX '98, held July 18-19, 1998, University of Aalborg, Denmark, in conjunction with ICALP '98
备用描述
The independent set problem is that of finding a maximum size set of mutually non-adjacent vertices in a graph.
备用描述
Lecture Notes in Computer Science
Erscheinungsdatum: 01.07.1998
开源日期
2009-12-04
更多信息……

🚀 快速下载

成为会员以支持书籍、论文等的长期保存。为了感谢您对我们的支持，您将获得高速下载权益。❤️

🐢 低速下载

由可信的合作方提供。 更多信息请参见常见问题解答。 （可能需要验证浏览器——无限次下载！）

所有选项下载的文件都相同，应该可以安全使用。即使这样，从互联网下载文件时始终要小心。例如，确保您的设备更新及时。
显示外部下载
  • 对于大文件，我们建议使用下载管理器以防止中断。
    推荐的下载管理器：Motrix
  • 您将需要一个电子书或 PDF 阅读器来打开文件，具体取决于文件格式。
    推荐的电子书阅读器：Anna的档案在线查看器、ReadEra和Calibre
  • 使用在线工具进行格式转换。
    推荐的转换工具：CloudConvert和PrintFriendly
  • 您可以将 PDF 和 EPUB 文件发送到您的 Kindle 或 Kobo 电子阅读器。
    推荐的工具：亚马逊的“发送到 Kindle”和djazz 的“发送到 Kobo/Kindle”
  • 支持作者和图书馆
    ✍️ 如果您喜欢这个并且能够负担得起，请考虑购买原版，或直接支持作者。
    📚 如果您当地的图书馆有这本书，请考虑在那里免费借阅。