The following pages link to Vangelis Th. Paschos (Q218830):
Displaying 44 items.
- (Q4792058) (← links)
- Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation (Q4809670) (← links)
- Approximation preserving reductions for set covering, vertex covering and independent set hierarchies under differential approximationa (Q4831416) (← links)
- (Q4843442) (← links)
- (Q4845153) (← links)
- (Q4864343) (← links)
- A New Efficient Heuristic for the Minimum Set Covering Problem (Q4864354) (← links)
- (Q4865402) (← links)
- (Q4866843) (← links)
- A relation between the approximated versions of minimum set covering, minimum vertex covering and maximum independent set (Q4887135) (← links)
- (Q4889464) (← links)
- New Results on Polynomial Inapproximability and Fixed Parameter Approximability of edge dominating set (Q4899238) (← links)
- Exact and Approximation Algorithms for Densest k-Subgraph (Q4914440) (← links)
- The Probabilistic Min Dominating Set Problem (Q4928494) (← links)
- New Algorithms for Mixed Dominating Set (Q5038189) (← links)
- (Q5116470) (← links)
- (Q5136270) (← links)
- On the approximation of NP-complete problems by using the Boltzmann machine method: the cases of some covering and packing problems (Q5375431) (← links)
- Theoretical Computer Science (Q5395073) (← links)
- Mathematical Foundations of Computer Science 2003 (Q5431303) (← links)
- Vertex-Uncertainty in Graph-Problems (Q5505652) (← links)
- Hamiltonian problems in edge-colored complete graphs and eulerian cycles in edge-colored graphs : some complexity results (Q5689636) (← links)
- (Q5702337) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5710819) (← links)
- SOFSEM 2005: Theory and Practice of Computer Science (Q5711562) (← links)
- Algorithms and Computation (Q5712104) (← links)
- Algorithms and Computation (Q5712175) (← links)
- COMPLETENESS IN DIFFERENTIAL APPROXIMATION CLASSES (Q5714673) (← links)
- Reoptimization of Minimum and Maximum Traveling Salesman’s Tours (Q5757891) (← links)
- Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem (Q5892099) (← links)
- When polynomial approximation meets exact computation (Q5892165) (← links)
- Algorithms and Computation (Q5897901) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5902534) (← links)
- When polynomial approximation meets exact computation (Q5915964) (← links)
- Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem (Q5920391) (← links)
- Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation (Q5925558) (← links)
- Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation (Q5925677) (← links)
- A note on a new greedy-solution representation and a new greedy parallelizable heuristic for the traveling salesman problem (Q5950645) (← links)
- A priori optimization for the probabilistic maximum independent set problem (Q5958320) (← links)
- (Q6089653) (← links)
- Improved (In-)Approximability Bounds for d-Scattered Set (Q6107026) (← links)
- The Maximum Duo-Preservation String Mapping Problem with Bounded Alphabet * (Q6133865) (← links)
- Average-case complexity of a branch-and-bound algorithm for \textsc{Min Dominating Set} (Q6145803) (← links)
- Constructive -- non-constructive approximation and maximum independent set problem (Q6567680) (← links)
