Author
|
Conference
|
Journal
|
Organization
|
Year
|
DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all domains
Limit my searches in the following domains
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Related Publications
(968)
Reducibility Among Combinatorial Problems
Introduction to Algorithms, Second Edition
Computer and jobshop scheduling theory
Combinatorial Optimization: Algorithms and Complexity
Efficient Management of Transitive Relationships in Large Data and Knowledge Bases
Subscribe
Academic
Publications
Computers and Intractability: A Guide to the Theory of NP-Completeness
Edit
Computers and Intractability: A Guide to the Theory of NP-Completeness
(
Citations: 18809
)
BibTex
|
RIS
|
RefWorks
Download
Michael Randolph Garey
,
David S. Johnson
Conference:
Artificial Evolution - AE
, 1979
Cumulative
Annual
Citation Context
(10037)
...Most of these problems are classical combinatorial problems; for details and background, see textbooks on graph theory [33], combinatorial optimisation [79, 108], NP-completeness [
53
], and approximation algorithms [12, 122]...
Jukka Suomela
.
Survey of local algorithms
...First results were mentioned by Garey and Johnson [
16
], among them the NP-completeness of the balanced complete bipartite subgraph problem...
...Thus it is not surprising that poly nomial-time Turing reductions (in fact mainly Karp reductions) have been used in various hardness proofs for problems on bicliques [
16
]...
Serge Gaspers
,
et al.
On Independent Sets and Bicliques in Graphs
...According to the computational complexity theory [
16
], the RCPSP is one of the most intractable...
Oumar Koné
,
et al.
Event-based MILP models for resource-constrained project scheduling pr...
...Directed flow-cutset inequalities (6) is equivalent to the max-cut problem (which is NP-hard, [
14
])...
Christian Raack
,
et al.
On cut-based inequalities for capacitated network design polyhedra
...It is not known if (7) is a fundamentally NP-hard [
25
] problem or otherwise...
...by obtaining a polynomial time reduction from the NPcomplete problem of exact cover by three sets [
25
] into a suitably defined decision version, using a procedure similar to that followed in [26]...
Cheran M. Vithanage
,
et al.
MIMO-OFDM Pilot Placement Algorithms for Wideband Indoor Communication...
Order by:
Citations
(18809)
Survey of local algorithms
(
Citations: 14
)
Jukka Suomela
Published in 2012.
On Independent Sets and Bicliques in Graphs
Serge Gaspers
,
Dieter Kratsch
,
Mathieu Liedloff
Journal:
Algorithmica
, vol. 62, no. 3, pp. 1-22, 2012
Heuristic Burst Construction Algorithm for Improving Downlink Capacity in IEEE 802.16 OFDMA Systems
Joo-Young Baek
,
Young-Joo Suh
Journal:
IEEE Transactions on Mobile Computing - TMC
, vol. 11, no. 1, pp. 155-168, 2012
Environment-conscious scheduling of HPC applications on distributed Cloud-oriented data centers
(
Citations: 8
)
Saurabh Kumar Garg
,
Chee Shin Yeo
,
Arun Anandasivam
,
Rajkumar Buyya
Journal:
Journal of Parallel and Distributed Computing - JPDC
, vol. 71, no. 6, pp. 732-749, 2011
Optimizing Information Credibility in Social Swarming Applications
(
Citations: 4
)
Bin Liu
,
Peter Terlecky
,
Amotz Bar-noy
,
Ramesh Govindan
,
Michael J. Neely
Conference:
IEEE INFOCOM - INFOCOM
, pp. 556-560, 2011