Complexity and efficient approximability of two dimensional periodically specified problems
- Los Alamos National Lab., NM (United States)
- State Univ. of New York, Albany, NY (United States). Dept. of Computer Science
The authors consider the two dimensional periodic specifications: a method to specify succinctly objects with highly regular repetitive structure. These specifications arise naturally when processing engineering designs including VLSI designs. These specifications can specify objects whose sizes are exponentially larger than the sizes of the specification themselves. Consequently solving a periodically specified problem by explicitly expanding the instance is prohibitively expensive in terms of computational resources. This leads one to investigate the complexity and efficient approximability of solving graph theoretic and combinatorial problems when instances are specified using two dimensional periodic specifications. They prove the following results: (1) several classical NP-hard optimization problems become NEXPTIME-hard, when instances are specified using two dimensional periodic specifications; (2) in contrast, several of these NEXPTIME-hard problems have polynomial time approximation algorithms with guaranteed worst case performance.
- Research Organization:
- Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
- Sponsoring Organization:
- USDOE, Washington, DC (United States); National Science Foundation, Washington, DC (United States)
- DOE Contract Number:
- W-7405-ENG-36
- OSTI ID:
- 373930
- Report Number(s):
- LA-UR-96-1466; CONF-961004-3; ON: DE96011308; CNN: Grant CCR 90-06396; Grant CCR94-06611; TRN: AHC29619%%114
- Resource Relation:
- Conference: 37. annual symposium on foundations of computer science, Burlington, VT (United States), 13-16 Oct 1996; Other Information: PBD: [1996]
- Country of Publication:
- United States
- Language:
- English
Similar Records
Periodically specified problems: An exponential complexity gap between exact and approximate solutions
Periodically specified satisfiability problems: An alternative to domino problems