Conference paper · 1997

Solving NP-hard Combinatorial Problems in the Practical Sense (Abstract)

Toshihide Ibaraki

International Symposium on Algorithms and Computation, 1 · Published 17 December 1997

View at the publisherCite this paper

In brief

“Solving NP-hard Combinatorial Problems in the Practical Sense (Abstract)” is a 1997 conference paper by Toshihide Ibaraki, published in International Symposium on Algorithms and Computation. OpenAlex counts 0 citations as of 16 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.

Citations
0
Authors
1

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Ibaraki, T. (1997). Solving NP-hard Combinatorial Problems in the Practical Sense (Abstract). International Symposium on Algorithms and Computation, 1. https://dblp.uni-trier.de/db/conf/isaac/isaac97.html#Ibaraki97

MLA 9

Ibaraki, Toshihide. “Solving NP-hard Combinatorial Problems in the Practical Sense (Abstract).” International Symposium on Algorithms and Computation, 1997, p. 1. https://dblp.uni-trier.de/db/conf/isaac/isaac97.html#Ibaraki97.

Chicago

Ibaraki, Toshihide. 1997. “Solving NP-hard Combinatorial Problems in the Practical Sense (Abstract).” International Symposium on Algorithms and Computation: 1. https://dblp.uni-trier.de/db/conf/isaac/isaac97.html#Ibaraki97.

Harvard

Ibaraki, T. (1997) ‘Solving NP-hard Combinatorial Problems in the Practical Sense (Abstract)’, International Symposium on Algorithms and Computation, p. 1. Available at: https://dblp.uni-trier.de/db/conf/isaac/isaac97.html#Ibaraki97.

IEEE

T. Ibaraki, “Solving NP-hard Combinatorial Problems in the Practical Sense (Abstract),” International Symposium on Algorithms and Computation, p. 1, 1997.

BibTeX

@inproceedings{ibaraki1997solving,
  title     = {{Solving NP-hard Combinatorial Problems in the Practical Sense (Abstract)}},
  author    = {Ibaraki, Toshihide},
  booktitle = {International Symposium on Algorithms and Computation},
  year      = {1997},
  pages     = {1},
  url       = {https://dblp.uni-trier.de/db/conf/isaac/isaac97.html#Ibaraki97}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Topic and keywords

Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs

  • NP-hard problems
  • combinatorial optimization
  • practical algorithms
  • approximation algorithms
  • exact algorithms

Work with this paper

Most-cited papers in Computer Science

All highly cited Computer Science papers

Questions about this paper

How do I cite this paper in APA style?

Ibaraki, T. (1997). Solving NP-hard Combinatorial Problems in the Practical Sense (Abstract). International Symposium on Algorithms and Computation, 1. https://dblp.uni-trier.de/db/conf/isaac/isaac97.html#Ibaraki97

How many times has this paper been cited?

0 times, according to OpenAlex on 16 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

OpenAlex records no free legal copy. Check your library's access, the authors' pages or a repository, or ask the corresponding author for a copy.

Who wrote this paper?

Toshihide Ibaraki.

Bibliographic data from OpenAlex (CC0), last checked 16 November 2026. ResearchGuru does not host this paper; the links go to the publisher or the repository that does.