Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Kripasindhu Sikdar
On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem
RAIRO - Theoretical Informatics and Applications
Mathematics
Computer Science Applications
Software
Related publications
Hardness of Approximating the Minimum Distance of a Linear Code
IEEE Transactions on Information Theory
Computer Science Applications
Information Systems
Library
Information Sciences
On Approximating Complex Quadratic Optimization Problems via Semidefinite Programming Relaxations
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
A Note on the Boltzmann Distribution and the Linear Ordering Problem
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems
INFOR
Signal Processing
Computer Science Applications
Information Systems
A Polynomial-Time Linear Decision Tree for the Traveling Salesman Problem and Other NP-complete Problems
Discrete and Computational Geometry
Combinatorics
Mathematics
Geometry
Discrete Mathematics
Computational Theory
Topology
Theoretical Computer Science
Optimal Composition Ordering Problems for Piecewise Linear Functions
Algorithmica
Applied Mathematics
Computer Science Applications
Computer Science
On the Hardness of Approximating Shortest Integer Relations Among Rational Numbers
Theoretical Computer Science
Computer Science
Theoretical Computer Science
on the Application of Particle Swarm Optimization in Minimum Time Launch Vehicle Trajectory Optimization Problem
International Journal of Mechanical and Production Engineering Research and Development
Transfer Processes
Fluid Flow
Mechanical Engineering
Aerospace Engineering
On an Optimization Problem Related to Static Super-Replicating Strategies
SSRN Electronic Journal
