Approximating matchings in parallel:
Abstract: "We show that for any constant k> 0, a matching with cardinality at least [formula] times the maximum can be computed in NC."
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Stanford, Calif.
1991
|
| Series: | Stanford University / Computer Science Department: Report STAN-CS
1369 |
| Subjects: | |
| Summary: | Abstract: "We show that for any constant k> 0, a matching with cardinality at least [formula] times the maximum can be computed in NC." |
| Physical Description: | 5 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008979359 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940206s1991 |||| 00||| eng d | ||
| 035 | |a (OCoLC)25485223 | ||
| 035 | |a (DE-599)BVBBV008979359 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Fischer, Ted |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Approximating matchings in parallel |c Ted Fischer ; Andrew V. Goldberg ; Serge Plotkin |
| 264 | 1 | |a Stanford, Calif. |c 1991 | |
| 300 | |a 5 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Stanford University / Computer Science Department: Report STAN-CS |v 1369 | |
| 520 | 3 | |a Abstract: "We show that for any constant k> 0, a matching with cardinality at least [formula] times the maximum can be computed in NC." | |
| 650 | 4 | |a Matching theory | |
| 650 | 4 | |a Parallel computers | |
| 700 | 1 | |a Goldberg, Andrew V. |e Verfasser |4 aut | |
| 700 | 1 | |a Plotkin, Serge A. |e Verfasser |4 aut | |
| 810 | 2 | |a Computer Science Department: Report STAN-CS |t Stanford University |v 1369 |w (DE-604)BV008928280 |9 1369 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005930079 | ||
Record in the Search Index
| _version_ | 1804123318115106816 |
|---|---|
| any_adam_object | |
| author | Fischer, Ted Goldberg, Andrew V. Plotkin, Serge A. |
| author_facet | Fischer, Ted Goldberg, Andrew V. Plotkin, Serge A. |
| author_role | aut aut aut |
| author_sort | Fischer, Ted |
| author_variant | t f tf a v g av avg s a p sa sap |
| building | Verbundindex |
| bvnumber | BV008979359 |
| ctrlnum | (OCoLC)25485223 (DE-599)BVBBV008979359 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01189nam a2200325 cb4500</leader><controlfield tag="001">BV008979359</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1991 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)25485223</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008979359</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Fischer, Ted</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Approximating matchings in parallel</subfield><subfield code="c">Ted Fischer ; Andrew V. Goldberg ; Serge Plotkin</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Stanford, Calif.</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">5 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Stanford University / Computer Science Department: Report STAN-CS</subfield><subfield code="v">1369</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We show that for any constant k> 0, a matching with cardinality at least [formula] times the maximum can be computed in NC."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Matching theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel computers</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Goldberg, Andrew V.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Plotkin, Serge A.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Computer Science Department: Report STAN-CS</subfield><subfield code="t">Stanford University</subfield><subfield code="v">1369</subfield><subfield code="w">(DE-604)BV008928280</subfield><subfield code="9">1369</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005930079</subfield></datafield></record></collection> |
| id | DE-604.BV008979359 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:27:52Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005930079 |
| oclc_num | 25485223 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 5 S. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| record_format | marc |
| series2 | Stanford University / Computer Science Department: Report STAN-CS |
| spelling | Fischer, Ted Verfasser aut Approximating matchings in parallel Ted Fischer ; Andrew V. Goldberg ; Serge Plotkin Stanford, Calif. 1991 5 S. txt rdacontent n rdamedia nc rdacarrier Stanford University / Computer Science Department: Report STAN-CS 1369 Abstract: "We show that for any constant k> 0, a matching with cardinality at least [formula] times the maximum can be computed in NC." Matching theory Parallel computers Goldberg, Andrew V. Verfasser aut Plotkin, Serge A. Verfasser aut Computer Science Department: Report STAN-CS Stanford University 1369 (DE-604)BV008928280 1369 |
| spellingShingle | Fischer, Ted Goldberg, Andrew V. Plotkin, Serge A. Approximating matchings in parallel Matching theory Parallel computers |
| title | Approximating matchings in parallel |
| title_auth | Approximating matchings in parallel |
| title_exact_search | Approximating matchings in parallel |
| title_full | Approximating matchings in parallel Ted Fischer ; Andrew V. Goldberg ; Serge Plotkin |
| title_fullStr | Approximating matchings in parallel Ted Fischer ; Andrew V. Goldberg ; Serge Plotkin |
| title_full_unstemmed | Approximating matchings in parallel Ted Fischer ; Andrew V. Goldberg ; Serge Plotkin |
| title_short | Approximating matchings in parallel |
| title_sort | approximating matchings in parallel |
| topic | Matching theory Parallel computers |
| topic_facet | Matching theory Parallel computers |
| volume_link | (DE-604)BV008928280 |
| work_keys_str_mv | AT fischerted approximatingmatchingsinparallel AT goldbergandrewv approximatingmatchingsinparallel AT plotkinsergea approximatingmatchingsinparallel |