JSON-LD is the canonical representation for SciGraph data.

TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

[
  {
    "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
    "about": [
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Information and Computing Sciences", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0802", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Computation Theory and Mathematics", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Department of Computer Science, University of Minnesota, 55455-0159, Minneapolis, MN, USA", 
          "id": "http://www.grid.ac/institutes/grid.17635.36", 
          "name": [
            "Department of Computer Science, University of Minnesota, 55455-0159, Minneapolis, MN, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Dasgupta", 
        "givenName": "Bhaskar", 
        "id": "sg:person.0763403270.10", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.0763403270.10"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "School of Electrical Engineering, Purdue University, 47907-1285, West Lafayette, IN, USA", 
          "id": "http://www.grid.ac/institutes/grid.169077.e", 
          "name": [
            "School of Electrical Engineering, Purdue University, 47907-1285, West Lafayette, IN, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Roychowdhury", 
        "givenName": "Vwani", 
        "id": "sg:person.01342527761.33", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01342527761.33"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "1994", 
    "datePublishedReg": "1994-01-01", 
    "description": "We consider two optimization problems with geometric structures. The first one concerns the foUowing minimization problem, termed as the rectilinear polygon cover problem: \u201cCover certain features of a given rectilinear polygon (possibly with rectilinear holes) with the minimum number of rectangles included in the polygon.\u201d Depending upon whether one wants to cover the interior, boundary or corners of the polygon, the problem is termed as the interior, boundary or corner cover problem, respectively. Most of these problems are known to be NP-complete. In this chapter we survey some of the important previous results for these problems find provide a proof of impossibility of a polynomial-time approximation scheme for the interior and boundary cover problems. The second problem concerns routing in a segmented routing channel. The related problems are fundamental to routing and design automation for Field Programmable Gate Arrays (FPGAs), a new type of electrically programmable VLSI. In this chapter we survey the theoretical results on the combinatorial complexity and algorithm design for segmented channel routing. It is known that the segmented channel routing problem is in general NP-Complete. Efficient polynomial time algorithms for a number of important special cases are presented.", 
    "editor": [
      {
        "familyName": "Du", 
        "givenName": "Ding-Zhu", 
        "type": "Person"
      }, 
      {
        "familyName": "Sun", 
        "givenName": "Jie", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-1-4613-3629-7_3", 
    "inLanguage": "en", 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-1-4613-3631-0", 
        "978-1-4613-3629-7"
      ], 
      "name": "Advances in Optimization and Approximation", 
      "type": "Book"
    }, 
    "keywords": [
      "optimization problem", 
      "cover problem", 
      "geometric optimization problems", 
      "polynomial time approximation scheme", 
      "efficient polynomial time algorithm", 
      "important special case", 
      "Field Programmable Gate Array", 
      "important previous results", 
      "approximation scheme", 
      "general NP-Complete", 
      "polynomial time algorithm", 
      "minimization problem", 
      "theoretical results", 
      "proof of impossibility", 
      "geometric structure", 
      "combinatorial complexity", 
      "special case", 
      "time algorithm", 
      "second problem", 
      "rectilinear polygons", 
      "minimum number", 
      "related problems", 
      "programmable gate array", 
      "algorithm design", 
      "NP-Complete", 
      "routing channels", 
      "problem", 
      "previous results", 
      "first one", 
      "gate array", 
      "polygons", 
      "design automation", 
      "segmented channel routing", 
      "certain features", 
      "routing", 
      "segmented channel", 
      "scheme", 
      "algorithm", 
      "channel routing", 
      "programmable VLSI", 
      "rectangle", 
      "proof", 
      "new type", 
      "one", 
      "complexity", 
      "number", 
      "NPs", 
      "channels", 
      "results", 
      "VLSI", 
      "array", 
      "corner", 
      "structure", 
      "impossibility", 
      "design", 
      "chapter", 
      "cases", 
      "features", 
      "automation", 
      "types"
    ], 
    "name": "Two Geometric Optimization Problems", 
    "pagination": "30-57", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1032748234"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-1-4613-3629-7_3"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-1-4613-3629-7_3", 
      "https://app.dimensions.ai/details/publication/pub.1032748234"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-05-20T07:46", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220519/entities/gbq_results/chapter/chapter_352.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-1-4613-3629-7_3"
  }
]

Download the RDF metadata as:  json-ld nt turtle xml License info

This table displays all metadata directly associated to this object as RDF triples.

135 TRIPLES      23 PREDICATES      85 URIs      78 LITERALS      7 BLANK NODES