<?xml version="1.0" encoding="UTF-8"?>

<rdf:RDF
   xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
   xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#"
   xmlns="http://purl.org/rss/1.0/"
   xmlns:dc="http://purl.org/dc/elements/1.1/"
   xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/"
   xmlns:dcterms="http://purl.org/dc/terms/"

>
<channel rdf:about="http://www.citeulike.org/about">
<pubDate>Sat, 19 Jul 2008 04:44:19 BST</pubDate>


	<title>CiteULike: p2pstreaming's algorithm</title>
	<description>CiteULike: p2pstreaming's algorithm</description>


	<link>http://www.citeulike.org/user/p2pstreaming/tag/algorithm</link>
	<dc:publisher>CiteULike.org</dc:publisher>
	<dc:language>en-gb</dc:language>
	<dc:rights>Copyright &#169; 2004-2008 citeulike.org</dc:rights>
	<items>
    <rdf:Seq>
        <rdf:li rdf:resource="http://www.citeulike.org/user/p2pstreaming/article/1325237"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/p2pstreaming/article/334045"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/p2pstreaming/article/334031"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/p2pstreaming/article/334021"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/p2pstreaming/article/334009"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/p2pstreaming/article/333974"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/p2pstreaming/article/333945"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/p2pstreaming/article/333942"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/p2pstreaming/article/333937"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/p2pstreaming/article/333924"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/p2pstreaming/article/333921"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/p2pstreaming/article/333919"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/p2pstreaming/article/333892"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/p2pstreaming/article/333890"/>

	</rdf:Seq>
	</items>
	</channel>


<item rdf:about="http://www.citeulike.org/user/p2pstreaming/article/1325237">
    <title>Faster approximation algorithms for generalized flow</title>
    <link>http://www.citeulike.org/user/p2pstreaming/article/1325237</link>
    <description>&lt;i&gt;(1999), pp. 981-982.&lt;/i&gt;</description>
    <dc:title>Faster approximation algorithms for generalized flow</dc:title>

    <dc:creator>Kevin Wayne</dc:creator>
    <dc:creator>Lisa Fleischer</dc:creator>
    <dc:source>(1999), pp. 981-982.</dc:source>
    <dc:date>2007-05-24T14:44:56-00:00</dc:date>
    <prism:publicationYear>1999</prism:publicationYear>
    <prism:startingPage>981</prism:startingPage>
    <prism:endingPage>982</prism:endingPage>
    <prism:publisher>Society for Industrial and Applied Mathematics</prism:publisher>
    <prism:category>algorithm</prism:category>
    <prism:category>approximation</prism:category>
    <prism:category>flow</prism:category>
    <prism:category>generalized</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/p2pstreaming/article/334045">
    <title>The Maximum Concurrent Flow Problem</title>
    <link>http://www.citeulike.org/user/p2pstreaming/article/334045</link>
    <description>&lt;i&gt;Journal of ACM, Vol. 37 (1990)&lt;/i&gt;</description>
    <dc:title>The Maximum Concurrent Flow Problem</dc:title>

    <dc:creator>F Shahrokhi</dc:creator>
    <dc:creator>DW Matula</dc:creator>
    <dc:source>Journal of ACM, Vol. 37 (1990)</dc:source>
    <dc:date>2005-09-28T16:27:57-00:00</dc:date>
    <prism:publicationYear>1990</prism:publicationYear>
    <prism:publicationName>Journal of ACM</prism:publicationName>
    <prism:volume>37</prism:volume>
    <prism:category>algorithm</prism:category>
    <prism:category>flow</prism:category>
    <prism:category>multicommodity</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/p2pstreaming/article/334031">
    <title>Randomized Rounding: A Technique for Provably Good Algorithms and Algorithmic Proofs</title>
    <link>http://www.citeulike.org/user/p2pstreaming/article/334031</link>
    <description>&lt;i&gt;Combinatorica, Vol. 7 (1987)&lt;/i&gt;</description>
    <dc:title>Randomized Rounding: A Technique for Provably Good Algorithms and Algorithmic Proofs</dc:title>

    <dc:creator>P Raghavan</dc:creator>
    <dc:creator>CD Thompson</dc:creator>
    <dc:source>Combinatorica, Vol. 7 (1987)</dc:source>
    <dc:date>2005-09-28T16:27:52-00:00</dc:date>
    <prism:publicationYear>1987</prism:publicationYear>
    <prism:publicationName>Combinatorica</prism:publicationName>
    <prism:volume>7</prism:volume>
    <prism:category>algorithm</prism:category>
    <prism:category>multicommodity</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/p2pstreaming/article/334021">
    <title>Fast Approximation Algorithms for Fractional Packing and Covering Problems</title>
    <link>http://www.citeulike.org/user/p2pstreaming/article/334021</link>
    <description>&lt;i&gt;Mathematics of Operation Research, Vol. 20 (1995)&lt;/i&gt;</description>
    <dc:title>Fast Approximation Algorithms for Fractional Packing and Covering Problems</dc:title>

    <dc:creator>A Plotkin</dc:creator>
    <dc:creator>D Shmoys</dc:creator>
    <dc:creator>E Tardos</dc:creator>
    <dc:source>Mathematics of Operation Research, Vol. 20 (1995)</dc:source>
    <dc:date>2005-09-28T16:27:49-00:00</dc:date>
    <prism:publicationYear>1995</prism:publicationYear>
    <prism:publicationName>Mathematics of Operation Research</prism:publicationName>
    <prism:volume>20</prism:volume>
    <prism:category>algorithm</prism:category>
    <prism:category>multicommodity</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/p2pstreaming/article/334009">
    <title>Edge-Disjoint Spanning Trees of Finite Graphs</title>
    <link>http://www.citeulike.org/user/p2pstreaming/article/334009</link>
    <description>&lt;i&gt;Journal of London Mathemathical Society, Vol. 36 (1961)&lt;/i&gt;</description>
    <dc:title>Edge-Disjoint Spanning Trees of Finite Graphs</dc:title>

    <dc:creator>Nash Williams</dc:creator>
    <dc:source>Journal of London Mathemathical Society, Vol. 36 (1961)</dc:source>
    <dc:date>2005-09-28T16:27:47-00:00</dc:date>
    <prism:publicationYear>1961</prism:publicationYear>
    <prism:publicationName>Journal of London Mathemathical Society</prism:publicationName>
    <prism:volume>36</prism:volume>
    <prism:category>algorithm</prism:category>
    <prism:category>graph</prism:category>
    <prism:category>theory</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/p2pstreaming/article/333974">
    <title>Reducibility among Combinatorial Problems</title>
    <link>http://www.citeulike.org/user/p2pstreaming/article/333974</link>
    <description>&lt;i&gt;Complexity of Computer Computations (1972)&lt;/i&gt;</description>
    <dc:title>Reducibility among Combinatorial Problems</dc:title>

    <dc:creator>RM Karp</dc:creator>
    <dc:source>Complexity of Computer Computations (1972)</dc:source>
    <dc:date>2005-09-28T16:27:42-00:00</dc:date>
    <prism:publicationYear>1972</prism:publicationYear>
    <prism:publicationName>Complexity of Computer Computations</prism:publicationName>
    <prism:publisher>R.E. Miller, J.W. Thatcher, Eds., Plenum Press</prism:publisher>
    <prism:category>algorithm</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/p2pstreaming/article/333945">
    <title>Geometric Algorithms and Combinatorial Optimizations</title>
    <link>http://www.citeulike.org/user/p2pstreaming/article/333945</link>
    <description>&lt;i&gt;(1993)&lt;/i&gt;</description>
    <dc:title>Geometric Algorithms and Combinatorial Optimizations</dc:title>

    <dc:creator>M Grotschel</dc:creator>
    <dc:creator>L Lovasz</dc:creator>
    <dc:creator>A Schrijver</dc:creator>
    <dc:source>(1993)</dc:source>
    <dc:date>2005-09-28T16:27:39-00:00</dc:date>
    <prism:publicationYear>1993</prism:publicationYear>
    <prism:publisher>Springer-Verlag</prism:publisher>
    <prism:category>algorithm</prism:category>
    <prism:category>graph</prism:category>
    <prism:category>theory</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/p2pstreaming/article/333942">
    <title>Computers and Intractability: A Guide to the Theory of NP-Completeness</title>
    <link>http://www.citeulike.org/user/p2pstreaming/article/333942</link>
    <description>&lt;i&gt;(1979)&lt;/i&gt;</description>
    <dc:title>Computers and Intractability: A Guide to the Theory of NP-Completeness</dc:title>

    <dc:creator>M Garey</dc:creator>
    <dc:creator>D Johnson</dc:creator>
    <dc:source>(1979)</dc:source>
    <dc:date>2005-09-28T16:27:38-00:00</dc:date>
    <prism:publicationYear>1979</prism:publicationYear>
    <prism:category>algorithm</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/p2pstreaming/article/333937">
    <title>Approximating Fractional Multicommodity Flow Independent of the Number of Commodities</title>
    <link>http://www.citeulike.org/user/p2pstreaming/article/333937</link>
    <description>&lt;i&gt;SIAM Journal of Discrete Mathematics, Vol. 13 (2000)&lt;/i&gt;</description>
    <dc:title>Approximating Fractional Multicommodity Flow Independent of the Number of Commodities</dc:title>

    <dc:creator>LK Fleischer</dc:creator>
    <dc:source>SIAM Journal of Discrete Mathematics, Vol. 13 (2000)</dc:source>
    <dc:date>2005-09-28T16:27:37-00:00</dc:date>
    <prism:publicationYear>2000</prism:publicationYear>
    <prism:publicationName>SIAM Journal of Discrete Mathematics</prism:publicationName>
    <prism:volume>13</prism:volume>
    <prism:category>algorithm</prism:category>
    <prism:category>flow</prism:category>
    <prism:category>linear</prism:category>
    <prism:category>multicommodity</prism:category>
    <prism:category>programming</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/p2pstreaming/article/333924">
    <title>Optimal Attack and Reinforcement of a Network</title>
    <link>http://www.citeulike.org/user/p2pstreaming/article/333924</link>
    <description>&lt;i&gt;Journal of ACM, Vol. 32 (1985)&lt;/i&gt;</description>
    <dc:title>Optimal Attack and Reinforcement of a Network</dc:title>

    <dc:creator>WH Cunningham</dc:creator>
    <dc:source>Journal of ACM, Vol. 32 (1985)</dc:source>
    <dc:date>2005-09-28T16:27:29-00:00</dc:date>
    <prism:publicationYear>1985</prism:publicationYear>
    <prism:publicationName>Journal of ACM</prism:publicationName>
    <prism:volume>32</prism:volume>
    <prism:category>algorithm</prism:category>
    <prism:category>theory</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/p2pstreaming/article/333921">
    <title>Layered Peer-to-peer Streaming</title>
    <link>http://www.citeulike.org/user/p2pstreaming/article/333921</link>
    <description>&lt;i&gt;(2003)&lt;/i&gt;</description>
    <dc:title>Layered Peer-to-peer Streaming</dc:title>

    <dc:creator>Y Cui</dc:creator>
    <dc:creator>K Nahrstedt</dc:creator>
    <dc:source>(2003)</dc:source>
    <dc:date>2005-09-28T16:27:29-00:00</dc:date>
    <prism:publicationYear>2003</prism:publicationYear>
    <prism:category>algorithm</prism:category>
    <prism:category>dynamic</prism:category>
    <prism:category>multimedia</prism:category>
    <prism:category>p2p</prism:category>
    <prism:category>programming</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/p2pstreaming/article/333919">
    <title>On Achieving Optimized Capacity Utilization in Application Overlahy Networks with Multiple Competing Sessions</title>
    <link>http://www.citeulike.org/user/p2pstreaming/article/333919</link>
    <description>&lt;i&gt;(2004)&lt;/i&gt;</description>
    <dc:title>On Achieving Optimized Capacity Utilization in Application Overlahy Networks with Multiple Competing Sessions</dc:title>

    <dc:creator>Y Cui</dc:creator>
    <dc:creator>Baochun Li</dc:creator>
    <dc:creator>K Nahrstedt</dc:creator>
    <dc:source>(2004)</dc:source>
    <dc:date>2005-09-28T16:27:29-00:00</dc:date>
    <prism:publicationYear>2004</prism:publicationYear>
    <prism:category>algorithm</prism:category>
    <prism:category>graph</prism:category>
    <prism:category>multicommodity</prism:category>
    <prism:category>theory</prism:category>
    <prism:category>topology</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/p2pstreaming/article/333892">
    <title>Computational Geometry: Algorithms and Applications</title>
    <link>http://www.citeulike.org/user/p2pstreaming/article/333892</link>
    <description>&lt;i&gt;(2000)&lt;/i&gt;</description>
    <dc:title>Computational Geometry: Algorithms and Applications</dc:title>

    <dc:creator>M de Berg</dc:creator>
    <dc:creator>M van Kreveld</dc:creator>
    <dc:creator>M Overmars</dc:creator>
    <dc:creator>O Schwarzkopf</dc:creator>
    <dc:source>(2000)</dc:source>
    <dc:date>2005-09-28T16:27:20-00:00</dc:date>
    <prism:publicationYear>2000</prism:publicationYear>
    <prism:publisher>Springer</prism:publisher>
    <prism:category>algorithm</prism:category>
    <prism:category>graph</prism:category>
    <prism:category>theory</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/p2pstreaming/article/333890">
    <title>Packing Spanning Trees</title>
    <link>http://www.citeulike.org/user/p2pstreaming/article/333890</link>
    <description>&lt;i&gt;Mathematics of Operation Research, Vol. 20 (1995)&lt;/i&gt;</description>
    <dc:title>Packing Spanning Trees</dc:title>

    <dc:creator>F Barahona</dc:creator>
    <dc:source>Mathematics of Operation Research, Vol. 20 (1995)</dc:source>
    <dc:date>2005-09-28T16:27:20-00:00</dc:date>
    <prism:publicationYear>1995</prism:publicationYear>
    <prism:publicationName>Mathematics of Operation Research</prism:publicationName>
    <prism:volume>20</prism:volume>
    <prism:category>algorithm</prism:category>
    <prism:category>graph</prism:category>
    <prism:category>multicast</prism:category>
    <prism:category>theory</prism:category>
</item>



</rdf:RDF>

