DOI: 10.1109/sct.1995.514860. On approximation algorithms for hierarchical MAX-SAT

On approximation algorithms for hierarchical MAX-SAT

10.1109/sct.1995.514860

Crossref proceedings-article

IEEE Comput. Soc. Press

Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference (263)

Bibliography

Agarwal, S., & Condon, A. (n.d.). On approximation algorithms for hierarchical MAX-SAT. Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference, 214â226.

Authors 2

S. Agarwal (first)
A. Condon (additional)

References 17 Referenced 1

10.1016/S0022-0000(74)80044-9
10.1007/3-540-16766-8_16
{'key': 'ref12', 'first-page': '139', 'article-title': 'The HILL System: A Design Environment for the Hierarchical Specification, Compaction, and Simulation of Integrated Circuit Layouts', 'author': 'lengauer', 'year': '1984', 'journal-title': 'Proc MIT Conference on Advanced Research in VLSI'} / Proc MIT Conference on Advanced Research in VLSI / The HILL System: A Design Environment for the Hierarchical Specification, Compaction, and Simulation of Integrated Circuit Layouts by lengauer (1984)
10.1016/0022-0000(92)90004-3
{'journal-title': 'Complexity of Partial Satisfaction II', 'year': '1982', 'author': 'lieberherr', 'key': 'ref14'} / Complexity of Partial Satisfaction II by lieberherr (1982)
10.1007/3-540-56939-1_63
{'key': 'ref16', 'first-page': '468', 'article-title': 'Hierarchical Specifications and Polynomial-Time Approximation Schemes for PSPACE-Complete Problems', 'author': 'marathe', 'year': '1994', 'journal-title': 'Proc 26th Symposium on Theory of Computing'} / Proc 26th Symposium on Theory of Computing / Hierarchical Specifications and Polynomial-Time Approximation Schemes for PSPACE-Complete Problems by marathe (1994)
10.1006/jagm.1994.1045
10.1109/SFCS.1991.185341
10.1109/SCT.1994.315796
{'key': 'ref6', 'first-page': '422', 'article-title': '878-Approximation Algorithms for MAX-CUT and MAX-2SAT', 'author': 'goemans', 'year': '1994', 'journal-title': 'Proc 26th Symposium on Theory of Computing'} / Proc 26th Symposium on Theory of Computing / 878-Approximation Algorithms for MAX-CUT and MAX-2SAT by goemans (1994)
{'key': 'ref5', 'first-page': '313', 'article-title': 'New 3/4-Approximation Algorithms for MAX SAT', 'author': 'goemans', 'year': '1993', 'journal-title': 'Proc 3rd Conference on Integer Programming and Combinatorial Optimization SIAM'} / Proc 3rd Conference on Integer Programming and Combinatorial Optimization SIAM / New 3/4-Approximation Algorithms for MAX SAT by goemans (1993)
{'year': '0', 'key': 'ref8'} (0)
{'year': '0', 'key': 'ref7'} (0)
10.1109/SFCS.1989.63449
10.1109/SFCS.1992.267823
10.1109/SFCS.1989.63486

Dates

Type	When
Created	22 years, 9 months ago (Nov. 19, 2002, 4:11 p.m.)
Deposited	8 years, 5 months ago (March 9, 2017, 6:58 p.m.)
Indexed	11 months, 2 weeks ago (Sept. 4, 2024, 10:34 p.m.)

Funders 0

None

BibTeX

@inproceedings{Agarwal, series={SCT-95}, title={On approximation algorithms for hierarchical MAX-SAT}, url={http://dx.doi.org/10.1109/sct.1995.514860}, DOI={10.1109/sct.1995.514860}, booktitle={Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference}, publisher={IEEE Comput. Soc. Press}, author={Agarwal, S. and Condon, A.}, pages={214–226}, collection={SCT-95} }

JSON

{
  "indexed": {
    "date-parts": [
      [
        2024,
        9,
        5
      ]
    ],
    "date-time": "2024-09-05T02:34:40Z",
    "timestamp": 1725503680671
  },
  "reference-count": 17,
  "publisher": "IEEE Comput. Soc. Press",
  "content-domain": {
    "domain": [],
    "crossmark-restriction": false
  },
  "DOI": "10.1109/sct.1995.514860",
  "type": "proceedings-article",
  "created": {
    "date-parts": [
      [
        2002,
        11,
        19
      ]
    ],
    "date-time": "2002-11-19T21:11:47Z",
    "timestamp": 1037740307000
  },
  "page": "214-226",
  "source": "Crossref",
  "is-referenced-by-count": 1,
  "title": "On approximation algorithms for hierarchical MAX-SAT",
  "prefix": "10.1109",
  "author": [
    {
      "given": "S.",
      "family": "Agarwal",
      "sequence": "first",
      "affiliation": []
    },
    {
      "given": "A.",
      "family": "Condon",
      "sequence": "additional",
      "affiliation": []
    }
  ],
  "member": "263",
  "reference": [
    {
      "key": "ref10",
      "doi-asserted-by": "publisher",
      "DOI": "10.1016/S0022-0000(74)80044-9"
    },
    {
      "key": "ref11",
      "doi-asserted-by": "publisher",
      "DOI": "10.1007/3-540-16766-8_16"
    },
    {
      "key": "ref12",
      "first-page": "139",
      "article-title": "The HILL System: A Design Environment for the Hierarchical Specification, Compaction, and Simulation of Integrated Circuit Layouts",
      "author": "lengauer",
      "year": "1984",
      "journal-title": "Proc MIT Conference on Advanced Research in VLSI"
    },
    {
      "key": "ref13",
      "doi-asserted-by": "publisher",
      "DOI": "10.1016/0022-0000(92)90004-3"
    },
    {
      "journal-title": "Complexity of Partial Satisfaction II",
      "year": "1982",
      "author": "lieberherr",
      "key": "ref14"
    },
    {
      "key": "ref15",
      "doi-asserted-by": "publisher",
      "DOI": "10.1007/3-540-56939-1_63"
    },
    {
      "key": "ref16",
      "first-page": "468",
      "article-title": "Hierarchical Specifications and Polynomial-Time Approximation Schemes for PSPACE-Complete Problems",
      "author": "marathe",
      "year": "1994",
      "journal-title": "Proc 26th Symposium on Theory of Computing"
    },
    {
      "key": "ref17",
      "doi-asserted-by": "publisher",
      "DOI": "10.1006/jagm.1994.1045"
    },
    {
      "key": "ref4",
      "doi-asserted-by": "publisher",
      "DOI": "10.1109/SFCS.1991.185341"
    },
    {
      "key": "ref3",
      "doi-asserted-by": "publisher",
      "DOI": "10.1109/SCT.1994.315796"
    },
    {
      "key": "ref6",
      "first-page": "422",
      "article-title": "878-Approximation Algorithms for MAX-CUT and MAX-2SAT",
      "author": "goemans",
      "year": "1994",
      "journal-title": "Proc 26th Symposium on Theory of Computing"
    },
    {
      "key": "ref5",
      "first-page": "313",
      "article-title": "New 3/4-Approximation Algorithms for MAX SAT",
      "author": "goemans",
      "year": "1993",
      "journal-title": "Proc 3rd Conference on Integer Programming and Combinatorial Optimization SIAM"
    },
    {
      "year": "0",
      "key": "ref8"
    },
    {
      "year": "0",
      "key": "ref7"
    },
    {
      "key": "ref2",
      "doi-asserted-by": "publisher",
      "DOI": "10.1109/SFCS.1989.63449"
    },
    {
      "key": "ref1",
      "doi-asserted-by": "publisher",
      "DOI": "10.1109/SFCS.1992.267823"
    },
    {
      "key": "ref9",
      "doi-asserted-by": "publisher",
      "DOI": "10.1109/SFCS.1989.63486"
    }
  ],
  "event": "Structure in Complexity Theory. Tenth Annual IEEE Conference",
  "container-title": "Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference",
  "original-title": [],
  "link": [
    {
      "URL": "http://xplorestaging.ieee.org/ielx3/3938/11407/00514860.pdf?arnumber=514860",
      "content-type": "unspecified",
      "content-version": "vor",
      "intended-application": "similarity-checking"
    }
  ],
  "deposited": {
    "date-parts": [
      [
        2017,
        3,
        9
      ]
    ],
    "date-time": "2017-03-09T23:58:56Z",
    "timestamp": 1489103936000
  },
  "score": 1,
  "resource": {
    "primary": {
      "URL": "http://ieeexplore.ieee.org/document/514860/"
    }
  },
  "subtitle": [],
  "short-title": [],
  "issued": {
    "date-parts": [
      [
        null
      ]
    ]
  },
  "references-count": 17,
  "URL": "http://dx.doi.org/10.1109/SCT.1995.514860",
  "relation": {},
  "subject": []
}